./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.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-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b0a853f0131530f88013a3fcfdf4f133f41c0569 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:30:10,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:30:10,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:30:10,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:30:10,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:30:10,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:30:10,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:30:10,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:30:10,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:30:10,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:30:10,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:30:10,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:30:10,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:30:10,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:30:10,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:30:10,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:30:10,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:30:10,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:30:10,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:30:10,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:30:10,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:30:10,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:30:10,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:30:10,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:30:10,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:30:10,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:30:10,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:30:10,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:30:10,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:30:10,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:30:10,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:30:10,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:30:10,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:30:10,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:30:10,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:30:10,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:30:10,425 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:30:10,454 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:30:10,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:30:10,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:30:10,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:30:10,456 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:30:10,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:30:10,456 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:30:10,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:30:10,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:30:10,456 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:30:10,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:30:10,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:30:10,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:30:10,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:30:10,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:30:10,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:30:10,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:30:10,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:30:10,461 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:30:10,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:30:10,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:30:10,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:30:10,462 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 -> b0a853f0131530f88013a3fcfdf4f133f41c0569 [2019-01-14 01:30:10,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:30:10,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:30:10,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:30:10,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:30:10,516 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:30:10,517 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-14 01:30:10,588 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1970a26/769b3211c6e347d6b61e6a480253448c/FLAGe68260b5c [2019-01-14 01:30:10,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:30:10,974 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-14 01:30:10,982 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1970a26/769b3211c6e347d6b61e6a480253448c/FLAGe68260b5c [2019-01-14 01:30:11,337 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1970a26/769b3211c6e347d6b61e6a480253448c [2019-01-14 01:30:11,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:30:11,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:30:11,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:30:11,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:30:11,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:30:11,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f3a513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11, skipping insertion in model container [2019-01-14 01:30:11,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:30:11,387 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:30:11,595 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:30:11,601 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:30:11,625 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:30:11,642 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:30:11,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11 WrapperNode [2019-01-14 01:30:11,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:30:11,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:30:11,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:30:11,645 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:30:11,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:30:11,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:30:11,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:30:11,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:30:11,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... [2019-01-14 01:30:11,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:30:11,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:30:11,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:30:11,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:30:11,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:30:11,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:30:11,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:30:12,252 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:30:12,253 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 01:30:12,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:30:12 BoogieIcfgContainer [2019-01-14 01:30:12,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:30:12,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:30:12,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:30:12,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:30:12,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:30:11" (1/3) ... [2019-01-14 01:30:12,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fcb7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:30:12, skipping insertion in model container [2019-01-14 01:30:12,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:30:11" (2/3) ... [2019-01-14 01:30:12,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fcb7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:30:12, skipping insertion in model container [2019-01-14 01:30:12,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:30:12" (3/3) ... [2019-01-14 01:30:12,261 INFO L112 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-14 01:30:12,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:30:12,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 01:30:12,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 01:30:12,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:30:12,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:30:12,323 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:30:12,323 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:30:12,323 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:30:12,323 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:30:12,323 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:30:12,323 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:30:12,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:30:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 01:30:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:30:12,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:12,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:30:12,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-14 01:30:12,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:12,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:12,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:12,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:12,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:12,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,543 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-14 01:30:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:12,637 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-14 01:30:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:12,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-14 01:30:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:12,649 INFO L225 Difference]: With dead ends: 43 [2019-01-14 01:30:12,649 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 01:30:12,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 01:30:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 01:30:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:30:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-14 01:30:12,683 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 3 [2019-01-14 01:30:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:12,684 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-01-14 01:30:12,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-01-14 01:30:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 01:30:12,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:12,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 01:30:12,686 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-14 01:30:12,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:12,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:12,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:12,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:12,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:12,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:12,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,739 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-01-14 01:30:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:12,760 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-14 01:30:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:12,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 01:30:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:12,762 INFO L225 Difference]: With dead ends: 29 [2019-01-14 01:30:12,762 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:30:12,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:30:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 01:30:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:30:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 01:30:12,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 4 [2019-01-14 01:30:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:12,769 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 01:30:12,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-14 01:30:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:30:12,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:12,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:12,770 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1366845466, now seen corresponding path program 1 times [2019-01-14 01:30:12,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:12,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:12,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:12,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,824 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-01-14 01:30:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:12,894 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-14 01:30:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:12,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 01:30:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:12,897 INFO L225 Difference]: With dead ends: 51 [2019-01-14 01:30:12,898 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 01:30:12,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 01:30:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-14 01:30:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 01:30:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2019-01-14 01:30:12,906 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 7 [2019-01-14 01:30:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:12,906 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2019-01-14 01:30:12,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2019-01-14 01:30:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:30:12,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:12,907 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-14 01:30:12,907 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1366808307, now seen corresponding path program 1 times [2019-01-14 01:30:12,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:12,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:30:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:12,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:13,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:13,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:13,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-14 01:30:13,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:30:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:30:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:13,139 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 6 states. [2019-01-14 01:30:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:13,403 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-01-14 01:30:13,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:30:13,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-14 01:30:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:13,406 INFO L225 Difference]: With dead ends: 104 [2019-01-14 01:30:13,406 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 01:30:13,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 01:30:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 40. [2019-01-14 01:30:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 01:30:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2019-01-14 01:30:13,417 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 7 [2019-01-14 01:30:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:13,418 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-01-14 01:30:13,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:30:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2019-01-14 01:30:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:30:13,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:13,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:13,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 577463568, now seen corresponding path program 1 times [2019-01-14 01:30:13,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:13,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:13,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:13,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,452 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand 3 states. [2019-01-14 01:30:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:13,501 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2019-01-14 01:30:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:13,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 01:30:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:13,503 INFO L225 Difference]: With dead ends: 77 [2019-01-14 01:30:13,503 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 01:30:13,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 01:30:13,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-14 01:30:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 01:30:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-01-14 01:30:13,514 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 8 [2019-01-14 01:30:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-01-14 01:30:13,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-01-14 01:30:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 01:30:13,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:13,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:13,517 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:13,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:13,518 INFO L82 PathProgramCache]: Analyzing trace with hash 721693167, now seen corresponding path program 1 times [2019-01-14 01:30:13,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:13,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:13,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:13,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:13,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,573 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 3 states. [2019-01-14 01:30:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:13,661 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2019-01-14 01:30:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:13,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 01:30:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:13,664 INFO L225 Difference]: With dead ends: 139 [2019-01-14 01:30:13,664 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 01:30:13,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 01:30:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2019-01-14 01:30:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 01:30:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2019-01-14 01:30:13,681 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 9 [2019-01-14 01:30:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:13,682 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2019-01-14 01:30:13,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2019-01-14 01:30:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:30:13,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:13,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:13,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash 897651769, now seen corresponding path program 1 times [2019-01-14 01:30:13,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:13,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:13,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:30:13,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:30:13,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:30:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:30:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,751 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand 3 states. [2019-01-14 01:30:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:13,809 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2019-01-14 01:30:13,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:30:13,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 01:30:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:13,817 INFO L225 Difference]: With dead ends: 255 [2019-01-14 01:30:13,817 INFO L226 Difference]: Without dead ends: 253 [2019-01-14 01:30:13,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:30:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-14 01:30:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-01-14 01:30:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-14 01:30:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 377 transitions. [2019-01-14 01:30:13,865 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 377 transitions. Word has length 10 [2019-01-14 01:30:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:13,865 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 377 transitions. [2019-01-14 01:30:13,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:30:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 377 transitions. [2019-01-14 01:30:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:30:13,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:13,869 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:30:13,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:13,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash -795491305, now seen corresponding path program 1 times [2019-01-14 01:30:13,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,011 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 01:30:14,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:14,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:14,067 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 01:30:14,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:14,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:30:14,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:30:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:30:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:30:14,094 INFO L87 Difference]: Start difference. First operand 249 states and 377 transitions. Second operand 4 states. [2019-01-14 01:30:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:14,201 INFO L93 Difference]: Finished difference Result 449 states and 688 transitions. [2019-01-14 01:30:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:30:14,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 01:30:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:14,205 INFO L225 Difference]: With dead ends: 449 [2019-01-14 01:30:14,205 INFO L226 Difference]: Without dead ends: 447 [2019-01-14 01:30:14,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:30:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-14 01:30:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 357. [2019-01-14 01:30:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-14 01:30:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 543 transitions. [2019-01-14 01:30:14,228 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 543 transitions. Word has length 14 [2019-01-14 01:30:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:14,229 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 543 transitions. [2019-01-14 01:30:14,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:30:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 543 transitions. [2019-01-14 01:30:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:30:14,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:14,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:14,232 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 592160614, now seen corresponding path program 1 times [2019-01-14 01:30:14,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:14,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:14,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:14,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:14,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:30:14,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 01:30:14,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:14,345 INFO L87 Difference]: Start difference. First operand 357 states and 543 transitions. Second operand 5 states. [2019-01-14 01:30:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:14,489 INFO L93 Difference]: Finished difference Result 610 states and 939 transitions. [2019-01-14 01:30:14,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:14,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 01:30:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:14,496 INFO L225 Difference]: With dead ends: 610 [2019-01-14 01:30:14,497 INFO L226 Difference]: Without dead ends: 608 [2019-01-14 01:30:14,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-01-14 01:30:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-01-14 01:30:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-14 01:30:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 701 transitions. [2019-01-14 01:30:14,524 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 701 transitions. Word has length 16 [2019-01-14 01:30:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:14,524 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 701 transitions. [2019-01-14 01:30:14,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2019-01-14 01:30:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 01:30:14,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:14,527 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:30:14,527 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1222343671, now seen corresponding path program 1 times [2019-01-14 01:30:14,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:14,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:14,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:14,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:14,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:14,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:14,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:30:14,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:30:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:30:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:30:14,656 INFO L87 Difference]: Start difference. First operand 464 states and 701 transitions. Second operand 4 states. [2019-01-14 01:30:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:15,002 INFO L93 Difference]: Finished difference Result 834 states and 1284 transitions. [2019-01-14 01:30:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:30:15,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-14 01:30:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:15,013 INFO L225 Difference]: With dead ends: 834 [2019-01-14 01:30:15,014 INFO L226 Difference]: Without dead ends: 832 [2019-01-14 01:30:15,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:30:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-01-14 01:30:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 668. [2019-01-14 01:30:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-01-14 01:30:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1007 transitions. [2019-01-14 01:30:15,055 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1007 transitions. Word has length 18 [2019-01-14 01:30:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:15,055 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 1007 transitions. [2019-01-14 01:30:15,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:30:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1007 transitions. [2019-01-14 01:30:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 01:30:15,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:15,063 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:30:15,065 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash -668230362, now seen corresponding path program 1 times [2019-01-14 01:30:15,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:15,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:15,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:15,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:15,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:15,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:30:15,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:15,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:15,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:30:15,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 01:30:15,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:15,271 INFO L87 Difference]: Start difference. First operand 668 states and 1007 transitions. Second operand 5 states. [2019-01-14 01:30:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:15,460 INFO L93 Difference]: Finished difference Result 1139 states and 1747 transitions. [2019-01-14 01:30:15,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:15,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 01:30:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:15,469 INFO L225 Difference]: With dead ends: 1139 [2019-01-14 01:30:15,469 INFO L226 Difference]: Without dead ends: 1137 [2019-01-14 01:30:15,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-01-14 01:30:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 871. [2019-01-14 01:30:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-01-14 01:30:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1297 transitions. [2019-01-14 01:30:15,518 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1297 transitions. Word has length 20 [2019-01-14 01:30:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:15,519 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1297 transitions. [2019-01-14 01:30:15,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1297 transitions. [2019-01-14 01:30:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 01:30:15,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:15,523 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 01:30:15,523 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2023206598, now seen corresponding path program 2 times [2019-01-14 01:30:15,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:15,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:15,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:15,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:15,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:15,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:15,785 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 01:30:15,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:15,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:15,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:15,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:15,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:15,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:30:15,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:15,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:15,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:15,873 INFO L87 Difference]: Start difference. First operand 871 states and 1297 transitions. Second operand 5 states. [2019-01-14 01:30:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:16,306 INFO L93 Difference]: Finished difference Result 1504 states and 2266 transitions. [2019-01-14 01:30:16,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:16,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 01:30:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:16,316 INFO L225 Difference]: With dead ends: 1504 [2019-01-14 01:30:16,316 INFO L226 Difference]: Without dead ends: 1502 [2019-01-14 01:30:16,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-01-14 01:30:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1193. [2019-01-14 01:30:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-01-14 01:30:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1768 transitions. [2019-01-14 01:30:16,379 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1768 transitions. Word has length 21 [2019-01-14 01:30:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:16,379 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1768 transitions. [2019-01-14 01:30:16,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1768 transitions. [2019-01-14 01:30:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 01:30:16,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:16,382 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 01:30:16,382 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1092753757, now seen corresponding path program 1 times [2019-01-14 01:30:16,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:16,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:16,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:16,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:16,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:16,629 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 01:30:16,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:16,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:16,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:16,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:30:16,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:16,734 INFO L87 Difference]: Start difference. First operand 1193 states and 1768 transitions. Second operand 5 states. [2019-01-14 01:30:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:17,155 INFO L93 Difference]: Finished difference Result 1951 states and 2902 transitions. [2019-01-14 01:30:17,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:17,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-14 01:30:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:17,168 INFO L225 Difference]: With dead ends: 1951 [2019-01-14 01:30:17,168 INFO L226 Difference]: Without dead ends: 1950 [2019-01-14 01:30:17,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-01-14 01:30:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1429. [2019-01-14 01:30:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-01-14 01:30:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2114 transitions. [2019-01-14 01:30:17,275 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2114 transitions. Word has length 25 [2019-01-14 01:30:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:17,276 INFO L480 AbstractCegarLoop]: Abstraction has 1429 states and 2114 transitions. [2019-01-14 01:30:17,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2114 transitions. [2019-01-14 01:30:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:30:17,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:17,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 01:30:17,281 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1883170607, now seen corresponding path program 2 times [2019-01-14 01:30:17,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:17,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:17,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:17,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:17,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:17,539 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 01:30:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:17,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:17,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:17,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:17,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:17,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:30:17,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:17,681 INFO L87 Difference]: Start difference. First operand 1429 states and 2114 transitions. Second operand 5 states. [2019-01-14 01:30:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:18,153 INFO L93 Difference]: Finished difference Result 2462 states and 3693 transitions. [2019-01-14 01:30:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:18,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-14 01:30:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:18,169 INFO L225 Difference]: With dead ends: 2462 [2019-01-14 01:30:18,170 INFO L226 Difference]: Without dead ends: 2460 [2019-01-14 01:30:18,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-01-14 01:30:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1959. [2019-01-14 01:30:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-01-14 01:30:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2882 transitions. [2019-01-14 01:30:18,296 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2882 transitions. Word has length 27 [2019-01-14 01:30:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:18,297 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2882 transitions. [2019-01-14 01:30:18,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2882 transitions. [2019-01-14 01:30:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 01:30:18,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:18,301 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 01:30:18,301 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -748146377, now seen corresponding path program 3 times [2019-01-14 01:30:18,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:18,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:18,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:18,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:18,682 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 01:30:18,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:18,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:30:18,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:18,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:18,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:18,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:30:18,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:30:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:30:18,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:18,851 INFO L87 Difference]: Start difference. First operand 1959 states and 2882 transitions. Second operand 6 states. [2019-01-14 01:30:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:19,505 INFO L93 Difference]: Finished difference Result 3173 states and 4732 transitions. [2019-01-14 01:30:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:30:19,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 01:30:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:19,530 INFO L225 Difference]: With dead ends: 3173 [2019-01-14 01:30:19,530 INFO L226 Difference]: Without dead ends: 3171 [2019-01-14 01:30:19,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2019-01-14 01:30:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 2563. [2019-01-14 01:30:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-01-14 01:30:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3749 transitions. [2019-01-14 01:30:19,705 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3749 transitions. Word has length 28 [2019-01-14 01:30:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:19,706 INFO L480 AbstractCegarLoop]: Abstraction has 2563 states and 3749 transitions. [2019-01-14 01:30:19,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:30:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3749 transitions. [2019-01-14 01:30:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 01:30:19,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:19,710 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 01:30:19,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1682870728, now seen corresponding path program 1 times [2019-01-14 01:30:19,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:19,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:19,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:19,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:19,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:19,966 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 01:30:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:20,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:20,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:20,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:30:20,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:30:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:30:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:20,060 INFO L87 Difference]: Start difference. First operand 2563 states and 3749 transitions. Second operand 5 states. [2019-01-14 01:30:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:20,549 INFO L93 Difference]: Finished difference Result 4182 states and 6155 transitions. [2019-01-14 01:30:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:30:20,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-14 01:30:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:20,572 INFO L225 Difference]: With dead ends: 4182 [2019-01-14 01:30:20,572 INFO L226 Difference]: Without dead ends: 4181 [2019-01-14 01:30:20,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:30:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-01-14 01:30:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 3071. [2019-01-14 01:30:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-01-14 01:30:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4483 transitions. [2019-01-14 01:30:20,712 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4483 transitions. Word has length 31 [2019-01-14 01:30:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:20,713 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 4483 transitions. [2019-01-14 01:30:20,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:30:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4483 transitions. [2019-01-14 01:30:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:30:20,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:20,718 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 01:30:20,718 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:20,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1047523897, now seen corresponding path program 2 times [2019-01-14 01:30:20,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:20,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:20,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:20,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:21,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:21,008 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 01:30:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:21,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:21,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:21,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:21,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:21,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:30:21,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:30:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:30:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:21,088 INFO L87 Difference]: Start difference. First operand 3071 states and 4483 transitions. Second operand 6 states. [2019-01-14 01:30:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:21,576 INFO L93 Difference]: Finished difference Result 4727 states and 6947 transitions. [2019-01-14 01:30:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:30:21,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-14 01:30:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:21,602 INFO L225 Difference]: With dead ends: 4727 [2019-01-14 01:30:21,602 INFO L226 Difference]: Without dead ends: 4726 [2019-01-14 01:30:21,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-01-14 01:30:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3459. [2019-01-14 01:30:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2019-01-14 01:30:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5047 transitions. [2019-01-14 01:30:21,746 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5047 transitions. Word has length 33 [2019-01-14 01:30:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:21,747 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 5047 transitions. [2019-01-14 01:30:21,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:30:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5047 transitions. [2019-01-14 01:30:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 01:30:21,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:21,751 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 01:30:21,751 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:21,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -507101786, now seen corresponding path program 4 times [2019-01-14 01:30:21,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:21,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:21,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:22,152 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 01:30:22,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:22,153 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 01:30:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:30:22,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:30:22,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:22,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:22,214 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 01:30:22,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:22,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:30:22,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:30:22,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:30:22,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:22,261 INFO L87 Difference]: Start difference. First operand 3459 states and 5047 transitions. Second operand 7 states. [2019-01-14 01:30:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:22,767 INFO L93 Difference]: Finished difference Result 5326 states and 7884 transitions. [2019-01-14 01:30:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:30:22,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-01-14 01:30:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:22,792 INFO L225 Difference]: With dead ends: 5326 [2019-01-14 01:30:22,792 INFO L226 Difference]: Without dead ends: 5324 [2019-01-14 01:30:22,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2019-01-14 01:30:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4377. [2019-01-14 01:30:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4377 states. [2019-01-14 01:30:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6353 transitions. [2019-01-14 01:30:23,024 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6353 transitions. Word has length 35 [2019-01-14 01:30:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:23,025 INFO L480 AbstractCegarLoop]: Abstraction has 4377 states and 6353 transitions. [2019-01-14 01:30:23,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:30:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6353 transitions. [2019-01-14 01:30:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 01:30:23,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:23,031 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 01:30:23,035 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash -32854327, now seen corresponding path program 3 times [2019-01-14 01:30:23,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:23,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:23,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:23,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:23,135 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 01:30:23,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:23,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:30:23,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:23,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:23,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:23,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:30:23,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:30:23,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:30:23,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:23,253 INFO L87 Difference]: Start difference. First operand 4377 states and 6353 transitions. Second operand 6 states. [2019-01-14 01:30:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:23,560 INFO L93 Difference]: Finished difference Result 7069 states and 10425 transitions. [2019-01-14 01:30:23,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:30:23,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-14 01:30:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:23,579 INFO L225 Difference]: With dead ends: 7069 [2019-01-14 01:30:23,579 INFO L226 Difference]: Without dead ends: 7067 [2019-01-14 01:30:23,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2019-01-14 01:30:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 5729. [2019-01-14 01:30:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-01-14 01:30:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8265 transitions. [2019-01-14 01:30:23,773 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8265 transitions. Word has length 36 [2019-01-14 01:30:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:23,773 INFO L480 AbstractCegarLoop]: Abstraction has 5729 states and 8265 transitions. [2019-01-14 01:30:23,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:30:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8265 transitions. [2019-01-14 01:30:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:30:23,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:23,777 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 01:30:23,777 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:23,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1137071253, now seen corresponding path program 2 times [2019-01-14 01:30:23,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:23,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:23,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:23,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:23,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:23,934 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 01:30:23,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:23,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:23,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:23,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:23,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:23,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 01:30:23,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:30:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:30:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:23,991 INFO L87 Difference]: Start difference. First operand 5729 states and 8265 transitions. Second operand 6 states. [2019-01-14 01:30:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:24,433 INFO L93 Difference]: Finished difference Result 8806 states and 12809 transitions. [2019-01-14 01:30:24,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:30:24,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-14 01:30:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:24,459 INFO L225 Difference]: With dead ends: 8806 [2019-01-14 01:30:24,459 INFO L226 Difference]: Without dead ends: 8805 [2019-01-14 01:30:24,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:30:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2019-01-14 01:30:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 6453. [2019-01-14 01:30:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-01-14 01:30:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 9305 transitions. [2019-01-14 01:30:24,701 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 9305 transitions. Word has length 41 [2019-01-14 01:30:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:24,701 INFO L480 AbstractCegarLoop]: Abstraction has 6453 states and 9305 transitions. [2019-01-14 01:30:24,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:30:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 9305 transitions. [2019-01-14 01:30:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 01:30:24,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:24,706 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 01:30:24,707 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 589297713, now seen corresponding path program 3 times [2019-01-14 01:30:24,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:24,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:24,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:24,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:24,935 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 01:30:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:24,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:30:24,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:24,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:24,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:24,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:30:24,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:30:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:30:24,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:24,996 INFO L87 Difference]: Start difference. First operand 6453 states and 9305 transitions. Second operand 7 states. [2019-01-14 01:30:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:25,220 INFO L93 Difference]: Finished difference Result 9500 states and 13815 transitions. [2019-01-14 01:30:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:30:25,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-14 01:30:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:25,240 INFO L225 Difference]: With dead ends: 9500 [2019-01-14 01:30:25,241 INFO L226 Difference]: Without dead ends: 9499 [2019-01-14 01:30:25,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2019-01-14 01:30:25,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 7025. [2019-01-14 01:30:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2019-01-14 01:30:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 10131 transitions. [2019-01-14 01:30:25,589 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 10131 transitions. Word has length 41 [2019-01-14 01:30:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:25,589 INFO L480 AbstractCegarLoop]: Abstraction has 7025 states and 10131 transitions. [2019-01-14 01:30:25,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:30:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 10131 transitions. [2019-01-14 01:30:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 01:30:25,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:25,594 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 01:30:25,596 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 644163159, now seen corresponding path program 5 times [2019-01-14 01:30:25,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:25,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:25,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:25,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:25,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:25,751 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 01:30:25,761 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:30:25,775 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:30:25,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:25,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:30:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:30:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:30:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:25,804 INFO L87 Difference]: Start difference. First operand 7025 states and 10131 transitions. Second operand 8 states. [2019-01-14 01:30:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:26,053 INFO L93 Difference]: Finished difference Result 10381 states and 15206 transitions. [2019-01-14 01:30:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:30:26,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-14 01:30:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:26,068 INFO L225 Difference]: With dead ends: 10381 [2019-01-14 01:30:26,069 INFO L226 Difference]: Without dead ends: 10379 [2019-01-14 01:30:26,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-01-14 01:30:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 8665. [2019-01-14 01:30:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-01-14 01:30:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 12438 transitions. [2019-01-14 01:30:26,332 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 12438 transitions. Word has length 42 [2019-01-14 01:30:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:26,333 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 12438 transitions. [2019-01-14 01:30:26,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:30:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 12438 transitions. [2019-01-14 01:30:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 01:30:26,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:26,337 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 01:30:26,337 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -809708433, now seen corresponding path program 4 times [2019-01-14 01:30:26,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:26,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:26,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:26,436 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 01:30:26,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:30:26,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:30:26,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:26,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:26,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:26,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:30:26,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:30:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:30:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:26,493 INFO L87 Difference]: Start difference. First operand 8665 states and 12438 transitions. Second operand 7 states. [2019-01-14 01:30:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:26,745 INFO L93 Difference]: Finished difference Result 13312 states and 19429 transitions. [2019-01-14 01:30:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:30:26,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-01-14 01:30:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:26,760 INFO L225 Difference]: With dead ends: 13312 [2019-01-14 01:30:26,760 INFO L226 Difference]: Without dead ends: 13310 [2019-01-14 01:30:26,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-01-14 01:30:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10967. [2019-01-14 01:30:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-01-14 01:30:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15657 transitions. [2019-01-14 01:30:27,336 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15657 transitions. Word has length 45 [2019-01-14 01:30:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:27,337 INFO L480 AbstractCegarLoop]: Abstraction has 10967 states and 15657 transitions. [2019-01-14 01:30:27,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:30:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15657 transitions. [2019-01-14 01:30:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 01:30:27,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:27,343 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 01:30:27,345 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -144620410, now seen corresponding path program 6 times [2019-01-14 01:30:27,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:27,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:27,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:27,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:27,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:27,565 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 01:30:27,577 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:30:27,626 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:30:27,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:27,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:27,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:27,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:30:27,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:30:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:30:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:27,656 INFO L87 Difference]: Start difference. First operand 10967 states and 15657 transitions. Second operand 9 states. [2019-01-14 01:30:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:27,918 INFO L93 Difference]: Finished difference Result 15622 states and 22665 transitions. [2019-01-14 01:30:27,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:30:27,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-01-14 01:30:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:27,933 INFO L225 Difference]: With dead ends: 15622 [2019-01-14 01:30:27,933 INFO L226 Difference]: Without dead ends: 15620 [2019-01-14 01:30:27,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-01-14 01:30:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 13091. [2019-01-14 01:30:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13091 states. [2019-01-14 01:30:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13091 states to 13091 states and 18609 transitions. [2019-01-14 01:30:28,338 INFO L78 Accepts]: Start accepts. Automaton has 13091 states and 18609 transitions. Word has length 49 [2019-01-14 01:30:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:28,338 INFO L480 AbstractCegarLoop]: Abstraction has 13091 states and 18609 transitions. [2019-01-14 01:30:28,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:30:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 13091 states and 18609 transitions. [2019-01-14 01:30:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 01:30:28,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:28,341 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 01:30:28,341 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:28,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2004605083, now seen corresponding path program 4 times [2019-01-14 01:30:28,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:28,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:28,548 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 01:30:28,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:28,549 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 01:30:28,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:30:28,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:30:28,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:28,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:28,588 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 01:30:28,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:28,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:30:28,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:30:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:30:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:28,610 INFO L87 Difference]: Start difference. First operand 13091 states and 18609 transitions. Second operand 8 states. [2019-01-14 01:30:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:28,973 INFO L93 Difference]: Finished difference Result 19890 states and 28521 transitions. [2019-01-14 01:30:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:30:28,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-14 01:30:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:28,995 INFO L225 Difference]: With dead ends: 19890 [2019-01-14 01:30:28,995 INFO L226 Difference]: Without dead ends: 19889 [2019-01-14 01:30:29,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19889 states. [2019-01-14 01:30:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19889 to 14129. [2019-01-14 01:30:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2019-01-14 01:30:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 20097 transitions. [2019-01-14 01:30:29,460 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 20097 transitions. Word has length 49 [2019-01-14 01:30:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:29,460 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 20097 transitions. [2019-01-14 01:30:29,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:30:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 20097 transitions. [2019-01-14 01:30:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 01:30:29,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:29,463 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 01:30:29,465 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash -85375778, now seen corresponding path program 3 times [2019-01-14 01:30:29,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:29,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:29,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:29,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:29,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:29,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:29,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:29,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:29,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 01:30:29,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:29,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:29,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:29,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:30:29,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:30:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:30:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:29,683 INFO L87 Difference]: Start difference. First operand 14129 states and 20097 transitions. Second operand 7 states. [2019-01-14 01:30:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:30,118 INFO L93 Difference]: Finished difference Result 20774 states and 29837 transitions. [2019-01-14 01:30:30,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:30:30,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-14 01:30:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:30,138 INFO L225 Difference]: With dead ends: 20774 [2019-01-14 01:30:30,138 INFO L226 Difference]: Without dead ends: 20773 [2019-01-14 01:30:30,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:30:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20773 states. [2019-01-14 01:30:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20773 to 15381. [2019-01-14 01:30:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15381 states. [2019-01-14 01:30:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15381 states to 15381 states and 21881 transitions. [2019-01-14 01:30:30,539 INFO L78 Accepts]: Start accepts. Automaton has 15381 states and 21881 transitions. Word has length 51 [2019-01-14 01:30:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:30,539 INFO L480 AbstractCegarLoop]: Abstraction has 15381 states and 21881 transitions. [2019-01-14 01:30:30,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:30:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15381 states and 21881 transitions. [2019-01-14 01:30:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 01:30:30,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:30,542 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 01:30:30,543 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash -884758135, now seen corresponding path program 5 times [2019-01-14 01:30:30,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:30,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:30,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:30,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:30,665 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:30:30,682 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:30:30,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:30,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:30,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:30,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:30:30,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:30:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:30:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:30,711 INFO L87 Difference]: Start difference. First operand 15381 states and 21881 transitions. Second operand 8 states. [2019-01-14 01:30:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:31,310 INFO L93 Difference]: Finished difference Result 22697 states and 32841 transitions. [2019-01-14 01:30:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:30:31,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-14 01:30:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:31,339 INFO L225 Difference]: With dead ends: 22697 [2019-01-14 01:30:31,339 INFO L226 Difference]: Without dead ends: 22695 [2019-01-14 01:30:31,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22695 states. [2019-01-14 01:30:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22695 to 18973. [2019-01-14 01:30:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-01-14 01:30:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 26864 transitions. [2019-01-14 01:30:31,795 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 26864 transitions. Word has length 54 [2019-01-14 01:30:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:31,796 INFO L480 AbstractCegarLoop]: Abstraction has 18973 states and 26864 transitions. [2019-01-14 01:30:31,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:30:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 26864 transitions. [2019-01-14 01:30:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 01:30:31,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:31,799 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 01:30:31,799 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -931224713, now seen corresponding path program 7 times [2019-01-14 01:30:31,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:31,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:31,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:31,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:31,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:32,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:32,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:32,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:32,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:32,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:30:32,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:30:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:30:32,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:32,537 INFO L87 Difference]: Start difference. First operand 18973 states and 26864 transitions. Second operand 10 states. [2019-01-14 01:30:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:33,075 INFO L93 Difference]: Finished difference Result 26251 states and 37778 transitions. [2019-01-14 01:30:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:30:33,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-14 01:30:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:33,103 INFO L225 Difference]: With dead ends: 26251 [2019-01-14 01:30:33,103 INFO L226 Difference]: Without dead ends: 26249 [2019-01-14 01:30:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26249 states. [2019-01-14 01:30:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26249 to 22311. [2019-01-14 01:30:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-01-14 01:30:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 31473 transitions. [2019-01-14 01:30:33,917 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 31473 transitions. Word has length 56 [2019-01-14 01:30:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:33,917 INFO L480 AbstractCegarLoop]: Abstraction has 22311 states and 31473 transitions. [2019-01-14 01:30:33,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:30:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 31473 transitions. [2019-01-14 01:30:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 01:30:33,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:33,921 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 01:30:33,922 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2041729275, now seen corresponding path program 5 times [2019-01-14 01:30:33,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:33,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:33,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:33,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:34,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:34,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:34,042 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:30:34,060 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:30:34,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:34,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:34,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:34,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:30:34,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:30:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:30:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:34,087 INFO L87 Difference]: Start difference. First operand 22311 states and 31473 transitions. Second operand 9 states. [2019-01-14 01:30:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:34,772 INFO L93 Difference]: Finished difference Result 32955 states and 46932 transitions. [2019-01-14 01:30:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:30:34,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-14 01:30:34,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:34,814 INFO L225 Difference]: With dead ends: 32955 [2019-01-14 01:30:34,814 INFO L226 Difference]: Without dead ends: 32954 [2019-01-14 01:30:34,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32954 states. [2019-01-14 01:30:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32954 to 23705. [2019-01-14 01:30:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23705 states. [2019-01-14 01:30:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23705 states to 23705 states and 33462 transitions. [2019-01-14 01:30:35,434 INFO L78 Accepts]: Start accepts. Automaton has 23705 states and 33462 transitions. Word has length 57 [2019-01-14 01:30:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:35,434 INFO L480 AbstractCegarLoop]: Abstraction has 23705 states and 33462 transitions. [2019-01-14 01:30:35,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:30:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 23705 states and 33462 transitions. [2019-01-14 01:30:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 01:30:35,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:35,439 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 01:30:35,439 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2087316113, now seen corresponding path program 4 times [2019-01-14 01:30:35,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:35,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:35,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:35,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:35,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:30:35,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:30:35,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:35,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:35,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:30:35,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:30:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:30:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:35,598 INFO L87 Difference]: Start difference. First operand 23705 states and 33462 transitions. Second operand 8 states. [2019-01-14 01:30:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:36,439 INFO L93 Difference]: Finished difference Result 33669 states and 48018 transitions. [2019-01-14 01:30:36,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:30:36,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-14 01:30:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:36,472 INFO L225 Difference]: With dead ends: 33669 [2019-01-14 01:30:36,472 INFO L226 Difference]: Without dead ends: 33668 [2019-01-14 01:30:36,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:30:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-01-14 01:30:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 25269. [2019-01-14 01:30:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25269 states. [2019-01-14 01:30:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25269 states to 25269 states and 35684 transitions. [2019-01-14 01:30:37,087 INFO L78 Accepts]: Start accepts. Automaton has 25269 states and 35684 transitions. Word has length 61 [2019-01-14 01:30:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:37,087 INFO L480 AbstractCegarLoop]: Abstraction has 25269 states and 35684 transitions. [2019-01-14 01:30:37,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:30:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25269 states and 35684 transitions. [2019-01-14 01:30:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:30:37,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:37,091 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 01:30:37,092 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1714864998, now seen corresponding path program 8 times [2019-01-14 01:30:37,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:37,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:37,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:37,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:37,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:37,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:30:37,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:30:37,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:37,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:37,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:37,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:30:37,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:30:37,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:30:37,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:37,295 INFO L87 Difference]: Start difference. First operand 25269 states and 35684 transitions. Second operand 11 states. [2019-01-14 01:30:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:37,998 INFO L93 Difference]: Finished difference Result 34130 states and 48968 transitions. [2019-01-14 01:30:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:30:37,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-01-14 01:30:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:38,033 INFO L225 Difference]: With dead ends: 34130 [2019-01-14 01:30:38,033 INFO L226 Difference]: Without dead ends: 34128 [2019-01-14 01:30:38,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:38,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2019-01-14 01:30:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 29345. [2019-01-14 01:30:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29345 states. [2019-01-14 01:30:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29345 states to 29345 states and 41306 transitions. [2019-01-14 01:30:39,109 INFO L78 Accepts]: Start accepts. Automaton has 29345 states and 41306 transitions. Word has length 63 [2019-01-14 01:30:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:39,109 INFO L480 AbstractCegarLoop]: Abstraction has 29345 states and 41306 transitions. [2019-01-14 01:30:39,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:30:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29345 states and 41306 transitions. [2019-01-14 01:30:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 01:30:39,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:39,113 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 01:30:39,114 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1360130479, now seen corresponding path program 6 times [2019-01-14 01:30:39,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:39,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:39,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:39,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:39,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:30:39,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:30:39,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:39,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:39,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:30:39,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:30:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:30:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:39,500 INFO L87 Difference]: Start difference. First operand 29345 states and 41306 transitions. Second operand 9 states. [2019-01-14 01:30:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:40,224 INFO L93 Difference]: Finished difference Result 41880 states and 59971 transitions. [2019-01-14 01:30:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:30:40,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-01-14 01:30:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:40,271 INFO L225 Difference]: With dead ends: 41880 [2019-01-14 01:30:40,271 INFO L226 Difference]: Without dead ends: 41878 [2019-01-14 01:30:40,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41878 states. [2019-01-14 01:30:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41878 to 35465. [2019-01-14 01:30:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-01-14 01:30:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 49718 transitions. [2019-01-14 01:30:41,119 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 49718 transitions. Word has length 63 [2019-01-14 01:30:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:41,119 INFO L480 AbstractCegarLoop]: Abstraction has 35465 states and 49718 transitions. [2019-01-14 01:30:41,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:30:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 49718 transitions. [2019-01-14 01:30:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 01:30:41,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:41,124 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 01:30:41,124 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:41,125 INFO L82 PathProgramCache]: Analyzing trace with hash -851477649, now seen corresponding path program 6 times [2019-01-14 01:30:41,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:41,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:41,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:41,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:41,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:41,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:41,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:30:41,313 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:30:41,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:41,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:41,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:30:41,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:30:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:30:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:41,345 INFO L87 Difference]: Start difference. First operand 35465 states and 49718 transitions. Second operand 10 states. [2019-01-14 01:30:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:42,524 INFO L93 Difference]: Finished difference Result 51129 states and 72397 transitions. [2019-01-14 01:30:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:30:42,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-14 01:30:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:42,576 INFO L225 Difference]: With dead ends: 51129 [2019-01-14 01:30:42,576 INFO L226 Difference]: Without dead ends: 51128 [2019-01-14 01:30:42,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51128 states. [2019-01-14 01:30:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51128 to 37261. [2019-01-14 01:30:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-01-14 01:30:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 52271 transitions. [2019-01-14 01:30:43,562 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 52271 transitions. Word has length 65 [2019-01-14 01:30:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:43,563 INFO L480 AbstractCegarLoop]: Abstraction has 37261 states and 52271 transitions. [2019-01-14 01:30:43,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:30:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 52271 transitions. [2019-01-14 01:30:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 01:30:43,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:43,568 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 01:30:43,568 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1457084265, now seen corresponding path program 9 times [2019-01-14 01:30:43,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:43,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:43,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:43,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:43,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:43,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:43,837 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:30:43,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:30:43,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:43,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:43,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:30:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:30:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:30:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:43,919 INFO L87 Difference]: Start difference. First operand 37261 states and 52271 transitions. Second operand 12 states. [2019-01-14 01:30:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:44,848 INFO L93 Difference]: Finished difference Result 49299 states and 70254 transitions. [2019-01-14 01:30:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:30:44,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-01-14 01:30:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:44,923 INFO L225 Difference]: With dead ends: 49299 [2019-01-14 01:30:44,923 INFO L226 Difference]: Without dead ends: 49297 [2019-01-14 01:30:44,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:30:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49297 states. [2019-01-14 01:30:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49297 to 42813. [2019-01-14 01:30:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2019-01-14 01:30:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 59889 transitions. [2019-01-14 01:30:46,296 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 59889 transitions. Word has length 70 [2019-01-14 01:30:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:46,296 INFO L480 AbstractCegarLoop]: Abstraction has 42813 states and 59889 transitions. [2019-01-14 01:30:46,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:30:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 59889 transitions. [2019-01-14 01:30:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 01:30:46,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:46,301 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 01:30:46,302 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:46,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1593226108, now seen corresponding path program 5 times [2019-01-14 01:30:46,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:46,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:46,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:46,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:46,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:30:46,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:30:46,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:46,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:46,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:30:46,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:30:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:30:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:46,480 INFO L87 Difference]: Start difference. First operand 42813 states and 59889 transitions. Second operand 9 states. [2019-01-14 01:30:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:47,463 INFO L93 Difference]: Finished difference Result 59102 states and 83563 transitions. [2019-01-14 01:30:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:30:47,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-14 01:30:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:47,548 INFO L225 Difference]: With dead ends: 59102 [2019-01-14 01:30:47,548 INFO L226 Difference]: Without dead ends: 59101 [2019-01-14 01:30:47,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:30:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59101 states. [2019-01-14 01:30:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59101 to 45005. [2019-01-14 01:30:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45005 states. [2019-01-14 01:30:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45005 states to 45005 states and 62987 transitions. [2019-01-14 01:30:48,732 INFO L78 Accepts]: Start accepts. Automaton has 45005 states and 62987 transitions. Word has length 71 [2019-01-14 01:30:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:48,732 INFO L480 AbstractCegarLoop]: Abstraction has 45005 states and 62987 transitions. [2019-01-14 01:30:48,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:30:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 45005 states and 62987 transitions. [2019-01-14 01:30:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 01:30:48,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:48,739 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 01:30:48,739 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1572566089, now seen corresponding path program 7 times [2019-01-14 01:30:48,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:48,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:48,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:48,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:30:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:49,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:49,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:49,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:49,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:49,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:30:49,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:30:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:30:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:49,064 INFO L87 Difference]: Start difference. First operand 45005 states and 62987 transitions. Second operand 10 states. [2019-01-14 01:30:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:50,264 INFO L93 Difference]: Finished difference Result 62465 states and 88920 transitions. [2019-01-14 01:30:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:30:50,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-01-14 01:30:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:50,329 INFO L225 Difference]: With dead ends: 62465 [2019-01-14 01:30:50,329 INFO L226 Difference]: Without dead ends: 62463 [2019-01-14 01:30:50,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:30:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62463 states. [2019-01-14 01:30:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62463 to 53489. [2019-01-14 01:30:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-01-14 01:30:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 74598 transitions. [2019-01-14 01:30:51,702 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 74598 transitions. Word has length 72 [2019-01-14 01:30:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:51,703 INFO L480 AbstractCegarLoop]: Abstraction has 53489 states and 74598 transitions. [2019-01-14 01:30:51,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:30:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 74598 transitions. [2019-01-14 01:30:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 01:30:51,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:51,709 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 01:30:51,709 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2147171801, now seen corresponding path program 7 times [2019-01-14 01:30:51,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:51,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:51,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:51,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:51,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:51,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:30:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:30:51,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:30:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:30:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:51,914 INFO L87 Difference]: Start difference. First operand 53489 states and 74598 transitions. Second operand 11 states. [2019-01-14 01:30:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:30:53,414 INFO L93 Difference]: Finished difference Result 75498 states and 106380 transitions. [2019-01-14 01:30:53,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:30:53,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-01-14 01:30:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:30:53,500 INFO L225 Difference]: With dead ends: 75498 [2019-01-14 01:30:53,500 INFO L226 Difference]: Without dead ends: 75497 [2019-01-14 01:30:53,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:30:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75497 states. [2019-01-14 01:30:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75497 to 55733. [2019-01-14 01:30:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55733 states. [2019-01-14 01:30:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55733 states to 55733 states and 77778 transitions. [2019-01-14 01:30:55,496 INFO L78 Accepts]: Start accepts. Automaton has 55733 states and 77778 transitions. Word has length 73 [2019-01-14 01:30:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:30:55,496 INFO L480 AbstractCegarLoop]: Abstraction has 55733 states and 77778 transitions. [2019-01-14 01:30:55,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:30:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55733 states and 77778 transitions. [2019-01-14 01:30:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 01:30:55,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:30:55,504 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1] [2019-01-14 01:30:55,504 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:30:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:30:55,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1519696454, now seen corresponding path program 10 times [2019-01-14 01:30:55,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:30:55,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:30:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:55,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:30:55,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:30:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:30:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:55,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:30:55,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:30:55,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:30:55,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:30:55,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:30:55,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:30:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:30:56,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 01:30:56,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 23 [2019-01-14 01:30:56,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 01:30:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 01:30:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:30:56,379 INFO L87 Difference]: Start difference. First operand 55733 states and 77778 transitions. Second operand 24 states. [2019-01-14 01:31:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:00,022 INFO L93 Difference]: Finished difference Result 74710 states and 103067 transitions. [2019-01-14 01:31:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-14 01:31:00,023 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-14 01:31:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:00,025 INFO L225 Difference]: With dead ends: 74710 [2019-01-14 01:31:00,026 INFO L226 Difference]: Without dead ends: 1364 [2019-01-14 01:31:00,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2234, Invalid=5776, Unknown=0, NotChecked=0, Total=8010 [2019-01-14 01:31:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-01-14 01:31:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 585. [2019-01-14 01:31:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-01-14 01:31:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 700 transitions. [2019-01-14 01:31:00,101 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 700 transitions. Word has length 77 [2019-01-14 01:31:00,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:00,101 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 700 transitions. [2019-01-14 01:31:00,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 01:31:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 700 transitions. [2019-01-14 01:31:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:31:00,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:00,103 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 01:31:00,103 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1093517585, now seen corresponding path program 8 times [2019-01-14 01:31:00,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:00,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:00,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:00,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:00,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:00,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:00,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:00,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:00,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:00,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:31:00,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:31:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:31:00,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:00,570 INFO L87 Difference]: Start difference. First operand 585 states and 700 transitions. Second operand 11 states. [2019-01-14 01:31:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:00,706 INFO L93 Difference]: Finished difference Result 701 states and 822 transitions. [2019-01-14 01:31:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:31:00,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-01-14 01:31:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:00,709 INFO L225 Difference]: With dead ends: 701 [2019-01-14 01:31:00,710 INFO L226 Difference]: Without dead ends: 587 [2019-01-14 01:31:00,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-14 01:31:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 481. [2019-01-14 01:31:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 01:31:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 563 transitions. [2019-01-14 01:31:00,728 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 563 transitions. Word has length 81 [2019-01-14 01:31:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:00,728 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 563 transitions. [2019-01-14 01:31:00,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:31:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 563 transitions. [2019-01-14 01:31:00,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:31:00,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:00,729 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 01:31:00,730 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash -944170313, now seen corresponding path program 6 times [2019-01-14 01:31:00,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:00,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:00,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:00,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:00,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:00,846 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:31:00,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:31:00,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:00,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:00,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:00,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:31:00,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:31:00,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:31:00,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:31:00,914 INFO L87 Difference]: Start difference. First operand 481 states and 563 transitions. Second operand 10 states. [2019-01-14 01:31:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:01,004 INFO L93 Difference]: Finished difference Result 546 states and 639 transitions. [2019-01-14 01:31:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:31:01,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-01-14 01:31:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:01,007 INFO L225 Difference]: With dead ends: 546 [2019-01-14 01:31:01,007 INFO L226 Difference]: Without dead ends: 379 [2019-01-14 01:31:01,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:31:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-14 01:31:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-01-14 01:31:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-01-14 01:31:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 417 transitions. [2019-01-14 01:31:01,021 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 417 transitions. Word has length 81 [2019-01-14 01:31:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:01,022 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 417 transitions. [2019-01-14 01:31:01,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:31:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 417 transitions. [2019-01-14 01:31:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 01:31:01,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:01,023 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 01:31:01,023 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2010450365, now seen corresponding path program 8 times [2019-01-14 01:31:01,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:01,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:01,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:01,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:01,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:01,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:01,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:01,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:31:01,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:31:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:31:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:01,228 INFO L87 Difference]: Start difference. First operand 379 states and 417 transitions. Second operand 12 states. [2019-01-14 01:31:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:01,276 INFO L93 Difference]: Finished difference Result 464 states and 501 transitions. [2019-01-14 01:31:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:31:01,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-01-14 01:31:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:01,278 INFO L225 Difference]: With dead ends: 464 [2019-01-14 01:31:01,278 INFO L226 Difference]: Without dead ends: 397 [2019-01-14 01:31:01,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-14 01:31:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 306. [2019-01-14 01:31:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-14 01:31:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2019-01-14 01:31:01,289 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 81 [2019-01-14 01:31:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:01,290 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2019-01-14 01:31:01,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:31:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2019-01-14 01:31:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 01:31:01,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:01,291 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 01:31:01,291 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1856106743, now seen corresponding path program 9 times [2019-01-14 01:31:01,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:01,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:01,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:01,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:01,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:31:01,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:31:01,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:01,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:31:01,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:31:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:31:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:01,654 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand 12 states. [2019-01-14 01:31:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:01,719 INFO L93 Difference]: Finished difference Result 319 states and 357 transitions. [2019-01-14 01:31:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:31:01,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 01:31:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:01,721 INFO L225 Difference]: With dead ends: 319 [2019-01-14 01:31:01,721 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 01:31:01,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 01:31:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2019-01-14 01:31:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 01:31:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2019-01-14 01:31:01,730 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 90 [2019-01-14 01:31:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:01,730 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2019-01-14 01:31:01,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:31:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2019-01-14 01:31:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 01:31:01,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:01,731 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 01:31:01,731 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1359938858, now seen corresponding path program 7 times [2019-01-14 01:31:01,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:31:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:02,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:02,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:02,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:02,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:02,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:31:02,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:31:02,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:31:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:02,071 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand 11 states. [2019-01-14 01:31:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:02,114 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2019-01-14 01:31:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:31:02,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-01-14 01:31:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:02,117 INFO L225 Difference]: With dead ends: 243 [2019-01-14 01:31:02,117 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 01:31:02,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:31:02,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 01:31:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 01:31:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 01:31:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 101 transitions. [2019-01-14 01:31:02,122 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 101 transitions. Word has length 91 [2019-01-14 01:31:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:02,123 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 101 transitions. [2019-01-14 01:31:02,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:31:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 101 transitions. [2019-01-14 01:31:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 01:31:02,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:31:02,124 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 01:31:02,124 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:31:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:31:02,125 INFO L82 PathProgramCache]: Analyzing trace with hash -498811939, now seen corresponding path program 8 times [2019-01-14 01:31:02,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:31:02,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:31:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:02,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:31:02,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:31:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:31:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:02,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:31:02,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:31:02,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:31:02,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:31:02,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:31:02,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:31:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:31:02,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:31:02,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:31:02,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:31:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:31:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:02,482 INFO L87 Difference]: Start difference. First operand 102 states and 101 transitions. Second operand 12 states. [2019-01-14 01:31:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:31:02,517 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2019-01-14 01:31:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:31:02,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-01-14 01:31:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:31:02,519 INFO L225 Difference]: With dead ends: 102 [2019-01-14 01:31:02,519 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:31:02,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:31:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:31:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:31:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:31:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:31:02,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-01-14 01:31:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:31:02,521 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:31:02,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:31:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:31:02,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:31:02,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:31:03,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:03,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:05,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:06,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:07,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:08,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:09,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:09,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:09,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:10,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:11,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:11,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:11,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:11,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:11,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:12,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:12,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:12,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:13,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:13,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:13,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:13,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:13,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:14,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:14,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:15,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:15,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:15,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:15,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:16,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:17,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:17,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:17,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:19,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:19,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:19,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:19,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:20,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:21,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:22,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:22,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:22,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:22,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:22,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:23,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:23,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:23,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:23,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:23,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:25,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:25,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:25,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:27,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:27,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:29,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:31,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:32,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:32,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:33,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:33,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:33,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:34,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:37,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:41,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:46,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:46,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:48,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:51,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:51,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:58,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:31:58,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:00,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:03,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:32:04,384 WARN L181 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 4654 DAG size of output: 3109 [2019-01-14 01:34:17,136 WARN L181 SmtUtils]: Spent 2.21 m on a formula simplification. DAG size of input: 2580 DAG size of output: 409 [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 01:34:17,144 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:34:17,145 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L451 ceAbstractionStarter]: At program point L34(lines 13 35) the Hoare annotation is: true [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-14 01:34:17,146 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-14 01:34:17,147 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-14 01:34:17,147 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:34:17,147 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 01:34:17,147 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2019-01-14 01:34:17,150 INFO L444 ceAbstractionStarter]: At program point L22-1(lines 19 33) the Hoare annotation is: (let ((.cse33 (<= ULTIMATE.start_main_~y~0 0)) (.cse84 (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) (.cse34 (<= ULTIMATE.start_main_~N~0 10)) (.cse89 (<= 0 (+ ULTIMATE.start_main_~y~0 2147483648))) (.cse40 (<= ULTIMATE.start_main_~x~0 0)) (.cse68 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse42 (<= ULTIMATE.start_main_~y~0 1)) (.cse51 (and .cse84 .cse34 .cse89 .cse40 .cse68)) (.cse11 (<= ULTIMATE.start_main_~x~0 3)) (.cse12 (and .cse34 .cse89 .cse68)) (.cse80 (and .cse33 .cse34 .cse89 .cse68)) (.cse65 (and .cse34 .cse40 .cse68)) (.cse35 (<= ULTIMATE.start_main_~x~0 1)) (.cse39 (<= 0 (+ ULTIMATE.start_main_~x~0 1))) (.cse8 (<= 0 ULTIMATE.start_main_~y~0)) (.cse38 (<= 0 (+ ULTIMATE.start_main_~x~0 2)))) (let ((.cse56 (and .cse33 .cse34 .cse38 .cse40 .cse89 .cse68)) (.cse60 (<= ULTIMATE.start_main_~x~0 2)) (.cse41 (<= ULTIMATE.start_main_~y~0 3)) (.cse81 (and .cse40 (and .cse84 .cse34 .cse68))) (.cse10 (<= ULTIMATE.start_main_~y~0 5)) (.cse87 (and .cse39 .cse34 .cse40 .cse8 .cse68)) (.cse4 (<= 9 ULTIMATE.start_main_~i~0)) (.cse86 (and .cse34 .cse35 .cse8 .cse68)) (.cse23 (<= 0 (+ ULTIMATE.start_main_~x~0 3))) (.cse37 (and .cse39 .cse33 .cse89 .cse65)) (.cse9 (<= 8 ULTIMATE.start_main_~i~0)) (.cse3 (<= 0 ULTIMATE.start_main_~x~0)) (.cse59 (<= 0 (+ ULTIMATE.start_main_~x~0 4))) (.cse7 (<= ULTIMATE.start_main_~x~0 5)) (.cse15 (<= 0 (+ ULTIMATE.start_main_~y~0 3))) (.cse67 (or (and .cse11 .cse12) .cse80)) (.cse20 (<= ULTIMATE.start_main_~y~0 2)) (.cse5 (and .cse34 .cse68)) (.cse0 (<= ULTIMATE.start_main_~x~0 4)) (.cse13 (and .cse33 .cse51)) (.cse28 (<= 0 (+ ULTIMATE.start_main_~y~0 2))) (.cse79 (and .cse42 .cse34 .cse68))) (let ((.cse22 (and .cse51 .cse8)) (.cse48 (and .cse38 .cse51 .cse8)) (.cse21 (and .cse8 .cse79)) (.cse25 (and .cse13 .cse28)) (.cse29 (<= ULTIMATE.start_main_~x~0 8)) (.cse58 (and .cse5 .cse0)) (.cse46 (<= ULTIMATE.start_main_~x~0 6)) (.cse1 (and .cse33 .cse34 .cse28 .cse68)) (.cse52 (and .cse0 .cse80)) (.cse69 (<= 1 ULTIMATE.start_main_~i~0)) (.cse18 (and .cse20 .cse84 .cse34 .cse40 .cse68)) (.cse74 (and .cse11 .cse67)) (.cse78 (and .cse84 .cse33 .cse34 .cse40 .cse15 .cse68)) (.cse49 (and .cse7 .cse12)) (.cse44 (and .cse59 .cse33 .cse51)) (.cse73 (or (and .cse37 .cse9) (and .cse33 .cse34 .cse35 .cse9 .cse89 .cse3))) (.cse54 (and .cse84 .cse33 .cse34 .cse40 .cse68)) (.cse64 (and .cse20 .cse12)) (.cse50 (<= 0 (+ ULTIMATE.start_main_~y~0 5))) (.cse75 (and .cse23 .cse13)) (.cse61 (<= 3 ULTIMATE.start_main_~i~0)) (.cse63 (<= 0 (+ ULTIMATE.start_main_~x~0 6))) (.cse82 (and .cse15 .cse80)) (.cse26 (<= 0 (+ ULTIMATE.start_main_~x~0 8))) (.cse55 (<= ULTIMATE.start_main_~y~0 7)) (.cse83 (and .cse39 .cse34 .cse40 .cse68)) (.cse70 (<= ULTIMATE.start_main_~y~0 8)) (.cse62 (or (and .cse4 .cse87) (and .cse4 .cse86 .cse3))) (.cse17 (and .cse33 .cse34 .cse3 .cse8 .cse68)) (.cse57 (<= 0 (+ ULTIMATE.start_main_~y~0 7))) (.cse47 (<= ULTIMATE.start_main_~x~0 7)) (.cse53 (and .cse10 .cse51)) (.cse76 (and .cse41 .cse81)) (.cse24 (<= ULTIMATE.start_main_~y~0 6)) (.cse16 (<= 10 ULTIMATE.start_main_~i~0)) (.cse66 (<= ULTIMATE.start_main_~x~0 9)) (.cse30 (and .cse33 .cse34 .cse68)) (.cse77 (and .cse84 .cse34 .cse40 .cse68)) (.cse43 (<= 2 ULTIMATE.start_main_~i~0)) (.cse88 (or (and .cse4 .cse56) (and .cse4 .cse33 .cse34 .cse89 .cse60 .cse3))) (.cse85 (and (and .cse11 .cse34 .cse68) .cse3)) (.cse32 (<= 0 (+ ULTIMATE.start_main_~y~0 4))) (.cse14 (<= 0 (+ ULTIMATE.start_main_~x~0 5))) (.cse45 (<= 0 (+ ULTIMATE.start_main_~y~0 6))) (.cse6 (<= ULTIMATE.start_main_~y~0 4)) (.cse36 (<= 5 ULTIMATE.start_main_~i~0)) (.cse2 (<= 6 ULTIMATE.start_main_~i~0)) (.cse27 (<= 7 ULTIMATE.start_main_~i~0)) (.cse19 (<= 0 (+ ULTIMATE.start_main_~x~0 7))) (.cse31 (<= 0 (+ ULTIMATE.start_main_~y~0 1))) (.cse71 (and .cse42 .cse84 .cse34 .cse40 .cse8 .cse68)) (.cse72 (<= 4 ULTIMATE.start_main_~i~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse3 .cse8) (and .cse9 (and .cse10 .cse11 .cse3 .cse12) .cse8) (and .cse13 .cse14 .cse9 .cse15) (and .cse16 (<= ULTIMATE.start_main_~x~0 10) .cse17) (and .cse4 .cse18 .cse19 .cse8) (and .cse20 .cse0 .cse12 .cse2 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse21) (and .cse4 .cse22 .cse23 .cse24) (and .cse16 .cse25 .cse26) (and .cse14 .cse13 .cse27 .cse28) (and .cse4 .cse29 .cse30 .cse31 .cse3) (and .cse32 .cse33 (or (and .cse34 .cse35 .cse36 .cse3) (and .cse37 .cse36))) (and .cse22 .cse38 .cse9 .cse24) (and .cse36 (and .cse39 .cse6 .cse34 .cse40) .cse8) (and .cse12 .cse41 .cse9 .cse7 .cse3 .cse8) (and .cse42 .cse34 .cse35 .cse43 .cse3 .cse8) (and .cse16 .cse44 .cse45) (and .cse16 (and .cse6 .cse12) .cse3 .cse8 .cse46) (and .cse4 .cse12 .cse41 .cse3 .cse8 .cse46) (and (and .cse47 .cse17) .cse27) (and .cse16 .cse48) (and .cse16 (and .cse33 .cse49 .cse3) .cse50) (and (and .cse6 .cse51) .cse27 .cse23 .cse8) (and (and .cse11 .cse41 .cse3 .cse8 .cse12) .cse2) (and .cse32 .cse9 .cse52 .cse3) (and .cse9 .cse23 .cse53 .cse8) (and .cse9 .cse26 .cse8 .cse54) (and .cse4 .cse48 .cse55) (and .cse56 .cse32 .cse2) (and .cse14 .cse36 .cse8 .cse54) (and .cse33 .cse34 .cse27 .cse57 .cse40 .cse3) (and .cse16 .cse58 .cse8 .cse3 .cse24) (and .cse27 .cse15 .cse52 .cse3) (and (and .cse33 .cse34 .cse3 .cse8 .cse46) .cse2) (and .cse59 .cse18 .cse2 .cse8) (and (and .cse41 .cse34 .cse60) .cse36 .cse3 .cse8) (and .cse4 .cse5 .cse60 .cse8 .cse3 .cse55) (and .cse1 .cse27 .cse7 .cse3) (and .cse0 .cse30 .cse36 .cse31 .cse3) (and .cse43 .cse38 .cse8 .cse54) (or (and .cse33 .cse61 .cse34 .cse35 .cse28 .cse3) (and .cse61 .cse37 .cse28)) (and (<= ULTIMATE.start_main_~y~0 9) .cse62 .cse3) (and .cse16 .cse33 .cse14 .cse51 .cse50) (and .cse33 .cse34 .cse27 .cse40 .cse63 .cse31) (and .cse64 .cse9 .cse3 .cse8 .cse46) (and .cse15 (or (and .cse33 .cse34 .cse60 .cse36 .cse3) (and .cse56 .cse36))) (and (or (and .cse39 .cse33 .cse43 .cse65) (and .cse33 .cse34 .cse35 .cse43 .cse3)) .cse31) (and .cse16 .cse66 .cse3 .cse21) (and .cse11 .cse33 .cse15 .cse67 .cse2 .cse3) (and .cse33 .cse34 .cse40 .cse3 .cse8 .cse68) (and .cse69 .cse33 .cse34 .cse40 .cse31 .cse3) (and .cse20 .cse61 .cse34 .cse35 .cse3 .cse8) (and .cse4 .cse44 .cse50) (and .cse65 .cse9 .cse70 .cse8 .cse3) (and .cse33 .cse34 .cse43 .cse28 .cse40 .cse3) (and .cse33 .cse45 .cse34 .cse9 .cse60 .cse3) (and .cse47 .cse9 .cse30 .cse31 .cse3) (and .cse27 .cse63 .cse71) (and .cse4 .cse25 .cse19) (and .cse33 .cse34 .cse40 .cse36 .cse50 .cse3) (and .cse16 .cse45 .cse52 .cse3) (and .cse10 .cse5 .cse35 .cse2 .cse3 .cse8) (and .cse14 .cse27 .cse18 .cse8) (and .cse9 .cse19 .cse71) (and (and .cse11 .cse42 .cse34) .cse72 .cse3 .cse8) (and .cse73 (<= 0 (+ ULTIMATE.start_main_~y~0 8)) .cse3) (and .cse65 .cse61 .cse41 .cse3 .cse8) (and .cse9 (and .cse42 .cse34 .cse47) .cse3 .cse8) (and .cse4 .cse45 (and .cse33 .cse74) .cse3) (and .cse32 .cse27 .cse75) (and .cse65 .cse27 .cse8 .cse3 .cse55) (and .cse11 .cse30 .cse72 .cse31 .cse3) (and .cse16 (and .cse29 .cse20 .cse34 .cse3 .cse8)) (and .cse4 (and .cse42 .cse29 .cse34 .cse3 .cse8)) (and .cse27 .cse19 .cse8 .cse54) (and .cse4 .cse76 .cse63 .cse8) (and .cse4 .cse66 .cse17) (and (and .cse41 .cse38 .cse51) .cse36 .cse8) (and .cse18 .cse23 .cse36 .cse8) (and .cse41 .cse23 .cse77 .cse2 .cse8) (and (and .cse6 .cse38 .cse51) .cse2 .cse8) (and .cse28 .cse23 .cse36 .cse13) (and .cse9 (and .cse29 .cse33 .cse34 .cse3 .cse8)) (and .cse9 .cse25 .cse63) (and .cse27 .cse30 .cse31 .cse3 .cse46) (and (or (and .cse33 .cse34 .cse27 .cse60 .cse3) (and .cse56 .cse27)) .cse50) (and .cse17 .cse36 .cse7) (and .cse16 .cse78 .cse19) (and .cse14 .cse2 .cse71) (and .cse79 .cse27 .cse3 .cse8 .cse46) (and .cse33 .cse61 .cse34 .cse40 .cse15 .cse3) (and .cse33 .cse45 .cse34 .cse40 .cse2 .cse3) (and .cse16 .cse32 .cse80 .cse3 .cse46) (and .cse16 (and (and .cse29 .cse1) .cse3)) (and .cse16 (and .cse81 .cse6) .cse63 .cse8) (and .cse59 .cse13 .cse28 .cse2) (and .cse32 .cse33 .cse27 .cse74 .cse3) (and .cse4 .cse45 .cse75) (and .cse16 .cse71) (and (or (and .cse37 .cse2) (and .cse33 .cse34 .cse35 .cse2 .cse3)) .cse50) (and .cse4 .cse33 .cse34 .cse40 .cse26 .cse31) (and (and .cse11 .cse20 .cse34) .cse36 .cse3 .cse8) (and .cse4 (<= 0 (+ ULTIMATE.start_main_~x~0 9)) .cse8 .cse54) (and .cse4 .cse82 .cse3 .cse46) (and .cse32 .cse33 .cse34 .cse40 .cse72 .cse3) (and .cse6 .cse9 .cse58 .cse3 .cse8) (and (or (and .cse27 .cse35 .cse5 .cse8 .cse3) (and .cse27 .cse83 .cse8)) .cse24) (and .cse59 .cse72 .cse8 .cse54) (and .cse61 .cse23 .cse8 .cse54) (and .cse6 .cse5 .cse60 .cse2 .cse3 .cse8) (and .cse16 .cse84 .cse33 .cse34 .cse40 .cse31) (and .cse4 (and .cse10 .cse0 .cse12) .cse3 .cse8) (and .cse1 .cse9 .cse3 .cse46) (and .cse4 .cse1 .cse47 .cse3) (and .cse4 .cse52 .cse50 .cse3) (and .cse33 .cse34 .cse40 .cse23 .cse72 .cse31) (and .cse16 .cse18 .cse26 .cse8) (and .cse41 .cse83 .cse72 .cse8) (and (and .cse10 (and .cse14 .cse81)) .cse16 .cse8) (and .cse16 (and .cse11 .cse3 .cse12) .cse55) (and .cse11 .cse17 .cse61) (and .cse32 .cse33 .cse34 .cse60 .cse2 .cse3) (and (or (and .cse69 .cse42 .cse34 .cse40 .cse3) (and .cse69 .cse39 .cse33 .cse34 .cse40) (and .cse69 .cse33 .cse34 .cse35 .cse3)) .cse8) (and .cse0 .cse36 .cse3 .cse8 .cse79) (and .cse14 .cse9 .cse76 .cse8) (and .cse4 .cse85 .cse8 .cse24) (and .cse9 .cse18 .cse63 .cse8) (and .cse61 (and .cse20 .cse39 .cse34 .cse40) .cse8) (and .cse9 .cse8 (and .cse59 .cse6 .cse81)) (and .cse16 (and .cse51 .cse23) .cse55) (and .cse16 (and .cse10 .cse12) .cse7 .cse3 .cse8) (and (and .cse65 .cse6) .cse72 .cse3 .cse8) (and .cse65 .cse2 .cse8 .cse3 .cse24) (and .cse59 .cse33 .cse34 .cse40 .cse36 .cse31) (and .cse33 .cse74 .cse9 .cse50 .cse3) (and .cse27 .cse64 .cse7 .cse3 .cse8) (and .cse4 .cse81 .cse6 .cse14 .cse8) (and .cse16 .cse5 .cse60 .cse8 .cse3) (and .cse4 .cse78 .cse63) (and .cse4 .cse32 .cse33 .cse49 .cse3) (and .cse44 .cse32 .cse9) (and .cse20 .cse34 .cse43 .cse40 .cse3 .cse8) (and .cse42 .cse61 .cse34 .cse60 .cse3 .cse8) (and .cse82 .cse9 .cse7 .cse3) (and (or (and .cse33 .cse61 .cse34 .cse60 .cse3) (and .cse33 .cse61 .cse34 .cse38 .cse40)) .cse31) (and .cse73 .cse57) (and .cse4 (and .cse10 .cse59 .cse51) .cse8) (and .cse63 .cse2 .cse8 .cse54) (and .cse4 .cse47 .cse64 .cse3 .cse8) (or (and .cse45 .cse37 .cse27) (and .cse33 .cse45 .cse34 .cse27 .cse35 .cse3)) (and .cse9 .cse50 .cse75) (and .cse71 .cse61 .cse38) (and .cse16 .cse32 .cse33 .cse51 .cse63) (and .cse82 .cse16 .cse47 .cse3) (and .cse59 .cse27 .cse15 .cse13) (and .cse4 .cse26 .cse71) (and (or (and .cse86 .cse9 .cse3) (and .cse9 .cse87)) .cse55) (and .cse30 .cse7 .cse2 .cse31 .cse3) (and (and .cse10 .cse83) .cse2 .cse8) (and .cse16 .cse19 (and .cse76 .cse8)) (and .cse5 .cse9 .cse60 .cse8 .cse3 .cse24) (and .cse41 .cse5 .cse35 .cse72 .cse3 .cse8) (and .cse70 .cse62) (and .cse17 .cse0 .cse72) (and .cse88 .cse57) (and .cse42 .cse39 .cse34 .cse43 .cse40 .cse8) (and (and .cse0 .cse41 .cse12) .cse27 .cse3 .cse8) (and .cse16 (and (and .cse12 .cse41) .cse47) .cse3 .cse8) (and .cse33 .cse14 .cse34 .cse40 .cse2 .cse31) (and .cse59 .cse36 .cse71) (and .cse53 .cse27 .cse38 .cse8) (and .cse59 .cse27 .cse76 .cse8) (and (or (and .cse33 .cse34 .cse60 .cse72 .cse3) (and .cse56 .cse72)) .cse28) (and .cse11 .cse28 .cse36 .cse80 .cse3) (and .cse16 (and .cse59 .cse51 .cse8) .cse24) (and .cse16 .cse66 .cse30 .cse31 .cse3) (and .cse10 .cse65 .cse36 .cse3 .cse8) (and .cse20 .cse38 .cse77 .cse72 .cse8) (and .cse33 .cse34 .cse43 .cse60 .cse3 .cse8) (and (or (and .cse34 .cse35 .cse72 .cse3) (and .cse37 .cse72)) .cse33 .cse15) (and (<= 0 (+ ULTIMATE.start_main_~y~0 9)) (and .cse39 .cse88)) (and .cse6 .cse85 .cse27 .cse8) (and (and .cse20 .cse34 .cse60) .cse72 .cse3 .cse8) (and .cse4 .cse32 .cse33 .cse14 .cse51) (and .cse56 .cse45 .cse9) (and .cse6 .cse35 .cse5 .cse36 .cse3 .cse8) (and .cse23 .cse13 .cse15 .cse2) (and .cse10 .cse27 .cse5 .cse60 .cse3 .cse8) (and .cse33 .cse34 .cse40 .cse9 .cse19 .cse31) (and .cse71 .cse23 .cse72)))))) [2019-01-14 01:34:17,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 01:34:17,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:34:17 BoogieIcfgContainer [2019-01-14 01:34:17,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:34:17,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:34:17,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:34:17,242 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:34:17,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:30:12" (3/4) ... [2019-01-14 01:34:17,256 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:34:17,272 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:34:17,274 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:34:17,374 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:34:17,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:34:17,376 INFO L168 Benchmark]: Toolchain (without parser) took 246033.37 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 951.4 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-14 01:34:17,380 INFO L168 Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:34:17,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:34:17,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:34:17,381 INFO L168 Benchmark]: Boogie Preprocessor took 27.57 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:34:17,385 INFO L168 Benchmark]: RCFGBuilder took 539.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:34:17,385 INFO L168 Benchmark]: TraceAbstraction took 244986.54 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-01-14 01:34:17,389 INFO L168 Benchmark]: Witness Printer took 132.01 ms. Allocated memory is still 4.0 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:34:17,399 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.99 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.67 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.57 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 539.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 244986.54 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 132.01 ms. Allocated memory is still 4.0 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 6 <= i) && 0 <= x) || (((((9 <= i && N <= 10 && 0 <= i) && y <= 4) && x <= 5) && 0 <= x) && 0 <= y)) || ((8 <= i && ((y <= 5 && x <= 3) && 0 <= x) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= y)) || ((((y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 5) && 8 <= i) && 0 <= y + 3)) || ((10 <= i && x <= 10) && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i)) || (((9 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 7) && 0 <= y)) || (((((y <= 2 && x <= 4) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 6 <= i) && 0 <= x) && 0 <= y)) || (((x <= 5 && 6 <= i) && 0 <= x) && 0 <= y && (y <= 1 && N <= 10) && 0 <= i)) || (((9 <= i && ((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && 0 <= x + 3) && y <= 6)) || ((10 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 8)) || (((0 <= x + 5 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= y + 2)) || ((((9 <= i && x <= 8) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((0 <= y + 4 && y <= 0) && ((((N <= 10 && x <= 1) && 5 <= i) && 0 <= x) || ((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 5 <= i)))) || ((((((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && 0 <= x + 2) && 8 <= i) && y <= 6)) || ((5 <= i && ((0 <= x + 1 && y <= 4) && N <= 10) && x <= 0) && 0 <= y)) || (((((((N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && 8 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || (((((y <= 1 && N <= 10) && x <= 1) && 2 <= i) && 0 <= x) && 0 <= y)) || ((10 <= i && (0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 6)) || ((((10 <= i && y <= 4 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (((((9 <= i && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && 0 <= x) && 0 <= y) && x <= 6)) || ((x <= 7 && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 7 <= i)) || (10 <= i && (0 <= x + 2 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || ((10 <= i && (y <= 0 && x <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y + 5)) || ((((y <= 4 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= x + 3) && 0 <= y)) || (((((x <= 3 && y <= 3) && 0 <= x) && 0 <= y) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 6 <= i)) || (((0 <= y + 4 && 8 <= i) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((8 <= i && 0 <= x + 3) && y <= 5 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || (((8 <= i && 0 <= x + 8) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || ((9 <= i && (0 <= x + 2 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && y <= 7)) || (((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 4) && 6 <= i)) || (((0 <= x + 5 && 5 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 0 && N <= 10) && 7 <= i) && 0 <= y + 7) && x <= 0) && 0 <= x)) || ((((10 <= i && (N <= 10 && 0 <= i) && x <= 4) && 0 <= y) && 0 <= x) && y <= 6)) || (((7 <= i && 0 <= y + 3) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && x <= 6) && 6 <= i)) || (((0 <= x + 4 && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || (((((y <= 3 && N <= 10) && x <= 2) && 5 <= i) && 0 <= x) && 0 <= y)) || (((((9 <= i && N <= 10 && 0 <= i) && x <= 2) && 0 <= y) && 0 <= x) && y <= 7)) || ((((((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 7 <= i) && x <= 5) && 0 <= x)) || ((((x <= 4 && (y <= 0 && N <= 10) && 0 <= i) && 5 <= i) && 0 <= y + 1) && 0 <= x)) || (((2 <= i && 0 <= x + 2) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 0 && 3 <= i) && N <= 10) && x <= 1) && 0 <= y + 2) && 0 <= x) || ((3 <= i && ((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 0 <= y + 2)) || ((y <= 9 && ((9 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) || ((9 <= i && ((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 0 <= x))) && 0 <= x)) || ((((10 <= i && y <= 0) && 0 <= x + 5) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 5)) || (((((y <= 0 && N <= 10) && 7 <= i) && x <= 0) && 0 <= x + 6) && 0 <= y + 1)) || (((((y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 8 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (0 <= y + 3 && (((((y <= 0 && N <= 10) && x <= 2) && 5 <= i) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 5 <= i)))) || (((((0 <= x + 1 && y <= 0) && 2 <= i) && (N <= 10 && x <= 0) && 0 <= i) || ((((y <= 0 && N <= 10) && x <= 1) && 2 <= i) && 0 <= x)) && 0 <= y + 1)) || (((10 <= i && x <= 9) && 0 <= x) && 0 <= y && (y <= 1 && N <= 10) && 0 <= i)) || (((((x <= 3 && y <= 0) && 0 <= y + 3) && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 6 <= i) && 0 <= x)) || (((((y <= 0 && N <= 10) && x <= 0) && 0 <= x) && 0 <= y) && 0 <= i)) || (((((1 <= i && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 1) && 0 <= x)) || (((((y <= 2 && 3 <= i) && N <= 10) && x <= 1) && 0 <= x) && 0 <= y)) || ((9 <= i && (0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 5)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 8 <= i) && y <= 8) && 0 <= y) && 0 <= x)) || (((((y <= 0 && N <= 10) && 2 <= i) && 0 <= y + 2) && x <= 0) && 0 <= x)) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && 8 <= i) && x <= 2) && 0 <= x)) || ((((x <= 7 && 8 <= i) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((7 <= i && 0 <= x + 6) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((9 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 7)) || (((((y <= 0 && N <= 10) && x <= 0) && 5 <= i) && 0 <= y + 5) && 0 <= x)) || (((10 <= i && 0 <= y + 6) && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || (((((y <= 5 && N <= 10 && 0 <= i) && x <= 1) && 6 <= i) && 0 <= x) && 0 <= y)) || (((0 <= x + 5 && 7 <= i) && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= y)) || ((8 <= i && 0 <= x + 7) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || (((((x <= 3 && y <= 1) && N <= 10) && 4 <= i) && 0 <= x) && 0 <= y)) || (((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 8 <= i) || (((((y <= 0 && N <= 10) && x <= 1) && 8 <= i) && 0 <= y + 2147483648) && 0 <= x)) && 0 <= y + 8) && 0 <= x)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 3 <= i) && y <= 3) && 0 <= x) && 0 <= y)) || (((8 <= i && (y <= 1 && N <= 10) && x <= 7) && 0 <= x) && 0 <= y)) || (((9 <= i && 0 <= y + 6) && y <= 0 && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 0 <= x)) || ((0 <= y + 4 && 7 <= i) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 7 <= i) && 0 <= y) && 0 <= x) && y <= 7)) || ((((x <= 3 && (y <= 0 && N <= 10) && 0 <= i) && 4 <= i) && 0 <= y + 1) && 0 <= x)) || (10 <= i && (((x <= 8 && y <= 2) && N <= 10) && 0 <= x) && 0 <= y)) || (9 <= i && (((y <= 1 && x <= 8) && N <= 10) && 0 <= x) && 0 <= y)) || (((7 <= i && 0 <= x + 7) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((9 <= i && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= x + 6) && 0 <= y)) || ((9 <= i && x <= 9) && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i)) || ((((y <= 3 && 0 <= x + 2) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 5 <= i) && 0 <= y)) || (((((((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 3) && 5 <= i) && 0 <= y)) || ((((y <= 3 && 0 <= x + 3) && ((0 <= x + 2147483648 && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || ((((y <= 4 && 0 <= x + 2) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || (((0 <= y + 2 && 0 <= x + 3) && 5 <= i) && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (8 <= i && (((x <= 8 && y <= 0) && N <= 10) && 0 <= x) && 0 <= y)) || ((8 <= i && (y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 0 <= x + 6)) || ((((7 <= i && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x) && x <= 6)) || ((((((y <= 0 && N <= 10) && 7 <= i) && x <= 2) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 7 <= i)) && 0 <= y + 5)) || ((((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 5 <= i) && x <= 5)) || ((10 <= i && ((((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= i) && 0 <= x + 7)) || ((0 <= x + 5 && 6 <= i) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((((y <= 1 && N <= 10) && 0 <= i) && 7 <= i) && 0 <= x) && 0 <= y) && x <= 6)) || (((((y <= 0 && 3 <= i) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= x)) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && x <= 0) && 6 <= i) && 0 <= x)) || ((((10 <= i && 0 <= y + 4) && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && x <= 6)) || (10 <= i && (x <= 8 && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 0 <= x)) || (((10 <= i && (x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && y <= 4) && 0 <= x + 6) && 0 <= y)) || (((0 <= x + 4 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 2) && 6 <= i)) || ((((0 <= y + 4 && y <= 0) && 7 <= i) && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 0 <= x)) || ((9 <= i && 0 <= y + 6) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (10 <= i && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 6 <= i) || ((((y <= 0 && N <= 10) && x <= 1) && 6 <= i) && 0 <= x)) && 0 <= y + 5)) || (((((9 <= i && y <= 0) && N <= 10) && x <= 0) && 0 <= x + 8) && 0 <= y + 1)) || (((((x <= 3 && y <= 2) && N <= 10) && 5 <= i) && 0 <= x) && 0 <= y)) || (((9 <= i && 0 <= x + 9) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((9 <= i && 0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && x <= 6)) || (((((0 <= y + 4 && y <= 0) && N <= 10) && x <= 0) && 4 <= i) && 0 <= x)) || ((((y <= 4 && 8 <= i) && (N <= 10 && 0 <= i) && x <= 4) && 0 <= x) && 0 <= y)) || ((((((7 <= i && x <= 1) && N <= 10 && 0 <= i) && 0 <= y) && 0 <= x) || ((7 <= i && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 0 <= y)) && y <= 6)) || (((0 <= x + 4 && 4 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((3 <= i && 0 <= x + 3) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || (((((y <= 4 && N <= 10 && 0 <= i) && x <= 2) && 6 <= i) && 0 <= x) && 0 <= y)) || (((((10 <= i && 0 <= x + 2147483648) && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 1)) || (((9 <= i && (y <= 5 && x <= 4) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y)) || ((((((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && 8 <= i) && 0 <= x) && x <= 6)) || (((9 <= i && ((y <= 0 && N <= 10) && 0 <= y + 2) && 0 <= i) && x <= 7) && 0 <= x)) || (((9 <= i && x <= 4 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 5) && 0 <= x)) || (((((y <= 0 && N <= 10) && x <= 0) && 0 <= x + 3) && 4 <= i) && 0 <= y + 1)) || (((10 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 8) && 0 <= y)) || (((y <= 3 && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 4 <= i) && 0 <= y)) || (((y <= 5 && 0 <= x + 5 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 10 <= i) && 0 <= y)) || ((10 <= i && (x <= 3 && 0 <= x) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 7)) || ((x <= 3 && (((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && 3 <= i)) || (((((0 <= y + 4 && y <= 0) && N <= 10) && x <= 2) && 6 <= i) && 0 <= x)) || (((((((1 <= i && y <= 1) && N <= 10) && x <= 0) && 0 <= x) || ((((1 <= i && 0 <= x + 1) && y <= 0) && N <= 10) && x <= 0)) || ((((1 <= i && y <= 0) && N <= 10) && x <= 1) && 0 <= x)) && 0 <= y)) || ((((x <= 4 && 5 <= i) && 0 <= x) && 0 <= y) && (y <= 1 && N <= 10) && 0 <= i)) || (((0 <= x + 5 && 8 <= i) && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || (((9 <= i && ((x <= 3 && N <= 10) && 0 <= i) && 0 <= x) && 0 <= y) && y <= 6)) || (((8 <= i && (((y <= 2 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= i) && 0 <= x + 6) && 0 <= y)) || ((3 <= i && ((y <= 2 && 0 <= x + 1) && N <= 10) && x <= 0) && 0 <= y)) || ((8 <= i && 0 <= y) && (0 <= x + 4 && y <= 4) && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i)) || ((10 <= i && ((((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 3) && y <= 7)) || ((((10 <= i && y <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 0) && 0 <= i) && y <= 4) && 4 <= i) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y) && 0 <= x) && y <= 6)) || (((((0 <= x + 4 && y <= 0) && N <= 10) && x <= 0) && 5 <= i) && 0 <= y + 1)) || ((((y <= 0 && x <= 3 && ((x <= 3 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) || (((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i))) && 8 <= i) && 0 <= y + 5) && 0 <= x)) || ((((7 <= i && y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && x <= 5) && 0 <= x) && 0 <= y)) || ((((9 <= i && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && y <= 4) && 0 <= x + 5) && 0 <= y)) || ((((10 <= i && N <= 10 && 0 <= i) && x <= 2) && 0 <= y) && 0 <= x)) || ((9 <= i && ((((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= y + 3) && 0 <= i) && 0 <= x + 6)) || ((((9 <= i && 0 <= y + 4) && y <= 0) && x <= 5 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || ((((0 <= x + 4 && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 4) && 8 <= i)) || (((((y <= 2 && N <= 10) && 2 <= i) && x <= 0) && 0 <= x) && 0 <= y)) || (((((y <= 1 && 3 <= i) && N <= 10) && x <= 2) && 0 <= x) && 0 <= y)) || ((((0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 8 <= i) && x <= 5) && 0 <= x)) || ((((((y <= 0 && 3 <= i) && N <= 10) && x <= 2) && 0 <= x) || ((((y <= 0 && 3 <= i) && N <= 10) && 0 <= x + 2) && x <= 0)) && 0 <= y + 1)) || ((((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 8 <= i) || (((((y <= 0 && N <= 10) && x <= 1) && 8 <= i) && 0 <= y + 2147483648) && 0 <= x)) && 0 <= y + 7)) || ((9 <= i && (y <= 5 && 0 <= x + 4) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y)) || (((0 <= x + 6 && 6 <= i) && 0 <= y) && (((0 <= x + 2147483648 && y <= 0) && N <= 10) && x <= 0) && 0 <= i)) || ((((9 <= i && x <= 7) && y <= 2 && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 0 <= x) && 0 <= y)) || ((0 <= y + 6 && ((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 7 <= i) || (((((y <= 0 && 0 <= y + 6) && N <= 10) && 7 <= i) && x <= 1) && 0 <= x)) || ((8 <= i && 0 <= y + 5) && 0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (((((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) && 3 <= i) && 0 <= x + 2)) || ((((10 <= i && 0 <= y + 4) && y <= 0) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= x + 6)) || ((((0 <= y + 3 && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 10 <= i) && x <= 7) && 0 <= x)) || (((0 <= x + 4 && 7 <= i) && 0 <= y + 3) && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || ((9 <= i && 0 <= x + 8) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || (((((((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 8 <= i) && 0 <= x) || (8 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) && y <= 7)) || ((((((y <= 0 && N <= 10) && 0 <= i) && x <= 5) && 6 <= i) && 0 <= y + 1) && 0 <= x)) || (((y <= 5 && ((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= i) && 6 <= i) && 0 <= y)) || ((10 <= i && 0 <= x + 7) && (y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || ((((((N <= 10 && 0 <= i) && 8 <= i) && x <= 2) && 0 <= y) && 0 <= x) && y <= 6)) || (((((y <= 3 && N <= 10 && 0 <= i) && x <= 1) && 4 <= i) && 0 <= x) && 0 <= y)) || (y <= 8 && ((9 <= i && (((0 <= x + 1 && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) || ((9 <= i && ((N <= 10 && x <= 1) && 0 <= y) && 0 <= i) && 0 <= x)))) || ((((((y <= 0 && N <= 10) && 0 <= x) && 0 <= y) && 0 <= i) && x <= 4) && 4 <= i)) || (((9 <= i && ((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) || (((((9 <= i && y <= 0) && N <= 10) && 0 <= y + 2147483648) && x <= 2) && 0 <= x)) && 0 <= y + 7)) || (((((y <= 1 && 0 <= x + 1) && N <= 10) && 2 <= i) && x <= 0) && 0 <= y)) || (((((x <= 4 && y <= 3) && (N <= 10 && 0 <= y + 2147483648) && 0 <= i) && 7 <= i) && 0 <= x) && 0 <= y)) || (((10 <= i && (((N <= 10 && 0 <= y + 2147483648) && 0 <= i) && y <= 3) && x <= 7) && 0 <= x) && 0 <= y)) || (((((y <= 0 && 0 <= x + 5) && N <= 10) && x <= 0) && 6 <= i) && 0 <= y + 1)) || ((0 <= x + 4 && 5 <= i) && ((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i)) || ((((y <= 5 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 7 <= i) && 0 <= x + 2) && 0 <= y)) || (((0 <= x + 4 && 7 <= i) && y <= 3 && x <= 0 && (0 <= x + 2147483648 && N <= 10) && 0 <= i) && 0 <= y)) || ((((((y <= 0 && N <= 10) && x <= 2) && 4 <= i) && 0 <= x) || ((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 4 <= i)) && 0 <= y + 2)) || ((((x <= 3 && 0 <= y + 2) && 5 <= i) && ((y <= 0 && N <= 10) && 0 <= y + 2147483648) && 0 <= i) && 0 <= x)) || ((10 <= i && (0 <= x + 4 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y) && y <= 6)) || ((((10 <= i && x <= 9) && (y <= 0 && N <= 10) && 0 <= i) && 0 <= y + 1) && 0 <= x)) || ((((y <= 5 && (N <= 10 && x <= 0) && 0 <= i) && 5 <= i) && 0 <= x) && 0 <= y)) || ((((y <= 2 && 0 <= x + 2) && ((0 <= x + 2147483648 && N <= 10) && x <= 0) && 0 <= i) && 4 <= i) && 0 <= y)) || (((((y <= 0 && N <= 10) && 2 <= i) && x <= 2) && 0 <= x) && 0 <= y)) || ((((((N <= 10 && x <= 1) && 4 <= i) && 0 <= x) || ((((0 <= x + 1 && y <= 0) && 0 <= y + 2147483648) && (N <= 10 && x <= 0) && 0 <= i) && 4 <= i)) && y <= 0) && 0 <= y + 3)) || (0 <= y + 9 && 0 <= x + 1 && ((9 <= i && ((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) || (((((9 <= i && y <= 0) && N <= 10) && 0 <= y + 2147483648) && x <= 2) && 0 <= x)))) || (((y <= 4 && ((x <= 3 && N <= 10) && 0 <= i) && 0 <= x) && 7 <= i) && 0 <= y)) || (((((y <= 2 && N <= 10) && x <= 2) && 4 <= i) && 0 <= x) && 0 <= y)) || ((((9 <= i && 0 <= y + 4) && y <= 0) && 0 <= x + 5) && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i)) || (((((((y <= 0 && N <= 10) && 0 <= x + 2) && x <= 0) && 0 <= y + 2147483648) && 0 <= i) && 0 <= y + 6) && 8 <= i)) || (((((y <= 4 && x <= 1) && N <= 10 && 0 <= i) && 5 <= i) && 0 <= x) && 0 <= y)) || (((0 <= x + 3 && y <= 0 && (((0 <= x + 2147483648 && N <= 10) && 0 <= y + 2147483648) && x <= 0) && 0 <= i) && 0 <= y + 3) && 6 <= i)) || (((((y <= 5 && 7 <= i) && N <= 10 && 0 <= i) && x <= 2) && 0 <= x) && 0 <= y)) || (((((y <= 0 && N <= 10) && x <= 0) && 8 <= i) && 0 <= x + 7) && 0 <= y + 1)) || (((((((y <= 1 && 0 <= x + 2147483648) && N <= 10) && x <= 0) && 0 <= y) && 0 <= i) && 0 <= x + 3) && 4 <= i) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. SAFE Result, 244.8s OverallTime, 44 OverallIterations, 11 TraceHistogramMax, 22.6s AutomataDifference, 0.0s DeadEndRemovalTime, 194.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1114 SDtfs, 6707 SDslu, 5061 SDs, 0 SdLazy, 1782 SolverSat, 967 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1883 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55733occurred in iteration=37, 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: 15.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 130600 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 1768 NumberOfFragments, 5870 HoareAnnotationTreeSize, 2 FomulaSimplifications, 653905 FormulaSimplificationTreeSizeReduction, 61.8s HoareSimplificationTime, 2 FomulaSimplificationsInter, 133427 FormulaSimplificationTreeSizeReductionInter, 132.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 3913 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 3831 ConstructedInterpolants, 0 QuantifiedInterpolants, 938773 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4480 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 82 InterpolantComputations, 9 PerfectInterpolantSequences, 388/11782 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...