./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-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/AliasDarteFeautrierGonnord-SAS2010-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 932d0be5444dce6d8d9a378b61966d0cdf64a5cb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:38:05,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:38:05,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:38:05,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:38:05,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:38:05,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:38:05,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:38:05,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:38:05,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:38:05,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:38:05,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:38:05,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:38:05,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:38:05,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:38:05,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:38:05,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:38:05,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:38:05,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:38:05,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:38:05,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:38:05,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:38:05,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:38:05,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:38:05,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:38:05,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:38:05,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:38:05,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:38:05,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:38:05,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:38:05,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:38:05,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:38:05,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:38:05,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:38:05,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:38:05,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:38:05,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:38:05,142 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:38:05,175 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:38:05,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:38:05,176 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:38:05,176 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:38:05,177 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:38:05,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:38:05,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:38:05,179 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:38:05,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:38:05,181 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:38:05,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:38:05,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:38:05,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:38:05,182 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:38:05,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:38:05,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:38:05,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:38:05,185 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:38:05,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:38:05,185 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:38:05,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:38:05,186 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 -> 932d0be5444dce6d8d9a378b61966d0cdf64a5cb [2019-01-14 21:38:05,248 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:38:05,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:38:05,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:38:05,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:38:05,269 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:38:05,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 21:38:05,333 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ca291e2/fb1d9e1aff0b42dcbdbbd1656ac8399c/FLAGb42cc0ad2 [2019-01-14 21:38:05,799 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:38:05,800 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 21:38:05,808 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ca291e2/fb1d9e1aff0b42dcbdbbd1656ac8399c/FLAGb42cc0ad2 [2019-01-14 21:38:06,151 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ca291e2/fb1d9e1aff0b42dcbdbbd1656ac8399c [2019-01-14 21:38:06,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:38:06,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:38:06,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:38:06,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:38:06,161 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:38:06,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06, skipping insertion in model container [2019-01-14 21:38:06,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:38:06,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:38:06,381 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:38:06,386 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:38:06,405 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:38:06,420 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:38:06,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06 WrapperNode [2019-01-14 21:38:06,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:38:06,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:38:06,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:38:06,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:38:06,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:38:06,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:38:06,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:38:06,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:38:06,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... [2019-01-14 21:38:06,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:38:06,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:38:06,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:38:06,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:38:06,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:38:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:38:06,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:38:07,056 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:38:07,056 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 21:38:07,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:07 BoogieIcfgContainer [2019-01-14 21:38:07,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:38:07,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:38:07,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:38:07,066 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:38:07,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:38:06" (1/3) ... [2019-01-14 21:38:07,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8869de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:38:07, skipping insertion in model container [2019-01-14 21:38:07,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:38:06" (2/3) ... [2019-01-14 21:38:07,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8869de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:38:07, skipping insertion in model container [2019-01-14 21:38:07,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:07" (3/3) ... [2019-01-14 21:38:07,071 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2019-01-14 21:38:07,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:38:07,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-14 21:38:07,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-14 21:38:07,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:38:07,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:38:07,146 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:38:07,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:38:07,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:38:07,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:38:07,146 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:38:07,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:38:07,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:38:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-14 21:38:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 21:38:07,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:07,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 21:38:07,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-14 21:38:07,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:07,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:07,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:07,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:07,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:07,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:07,354 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-14 21:38:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:07,450 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-14 21:38:07,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:07,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-14 21:38:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:07,466 INFO L225 Difference]: With dead ends: 43 [2019-01-14 21:38:07,466 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 21:38:07,471 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 21:38:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 21:38:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 21:38:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 21:38:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-14 21:38:07,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 3 [2019-01-14 21:38:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-01-14 21:38:07,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-01-14 21:38:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 21:38:07,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:07,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 21:38:07,509 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-14 21:38:07,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:07,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:07,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:07,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:07,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:07,557 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-01-14 21:38:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:07,619 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-14 21:38:07,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:07,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 21:38:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:07,623 INFO L225 Difference]: With dead ends: 29 [2019-01-14 21:38:07,623 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 21:38:07,624 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 21:38:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 21:38:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 21:38:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 21:38:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-14 21:38:07,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 4 [2019-01-14 21:38:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:07,631 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 21:38:07,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-14 21:38:07,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:38:07,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:07,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:07,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1366845466, now seen corresponding path program 1 times [2019-01-14 21:38:07,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:07,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:07,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:07,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:07,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:07,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:07,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:07,666 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-01-14 21:38:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:07,737 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-14 21:38:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:07,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 21:38:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:07,739 INFO L225 Difference]: With dead ends: 51 [2019-01-14 21:38:07,739 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 21:38:07,741 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 21:38:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 21:38:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-14 21:38:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 21:38:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2019-01-14 21:38:07,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 7 [2019-01-14 21:38:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:07,753 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2019-01-14 21:38:07,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2019-01-14 21:38:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 21:38:07,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:07,754 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-14 21:38:07,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1366808307, now seen corresponding path program 1 times [2019-01-14 21:38:07,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:07,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:07,841 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 21:38:07,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:07,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:07,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:07,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:07,962 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 21:38:07,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:07,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-14 21:38:07,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:38:07,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:38:07,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:38:07,983 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 6 states. [2019-01-14 21:38:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:08,320 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-01-14 21:38:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:38:08,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-14 21:38:08,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:08,322 INFO L225 Difference]: With dead ends: 104 [2019-01-14 21:38:08,322 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 21:38:08,323 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 21:38:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 21:38:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 40. [2019-01-14 21:38:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 21:38:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2019-01-14 21:38:08,337 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 7 [2019-01-14 21:38:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:08,337 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-01-14 21:38:08,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:38:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2019-01-14 21:38:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 21:38:08,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:08,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:08,339 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 577463568, now seen corresponding path program 1 times [2019-01-14 21:38:08,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:08,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:08,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:08,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:08,378 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand 3 states. [2019-01-14 21:38:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:08,430 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2019-01-14 21:38:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:08,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 21:38:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:08,432 INFO L225 Difference]: With dead ends: 77 [2019-01-14 21:38:08,432 INFO L226 Difference]: Without dead ends: 75 [2019-01-14 21:38:08,433 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 21:38:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-14 21:38:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-14 21:38:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 21:38:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-01-14 21:38:08,442 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 8 [2019-01-14 21:38:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:08,443 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-01-14 21:38:08,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-01-14 21:38:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:38:08,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:08,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:08,444 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash 721693167, now seen corresponding path program 1 times [2019-01-14 21:38:08,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:08,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:08,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:08,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:08,487 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 3 states. [2019-01-14 21:38:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:08,574 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2019-01-14 21:38:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:08,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 21:38:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:08,576 INFO L225 Difference]: With dead ends: 139 [2019-01-14 21:38:08,577 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 21:38:08,577 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 21:38:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 21:38:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2019-01-14 21:38:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 21:38:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2019-01-14 21:38:08,594 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 9 [2019-01-14 21:38:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:08,594 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2019-01-14 21:38:08,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2019-01-14 21:38:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:38:08,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:08,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:08,596 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 897651769, now seen corresponding path program 1 times [2019-01-14 21:38:08,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:38:08,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 21:38:08,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:38:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:38:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:38:08,668 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand 3 states. [2019-01-14 21:38:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:08,726 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2019-01-14 21:38:08,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:38:08,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 21:38:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:08,736 INFO L225 Difference]: With dead ends: 255 [2019-01-14 21:38:08,736 INFO L226 Difference]: Without dead ends: 253 [2019-01-14 21:38:08,737 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 21:38:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-14 21:38:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-01-14 21:38:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-14 21:38:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 377 transitions. [2019-01-14 21:38:08,776 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 377 transitions. Word has length 10 [2019-01-14 21:38:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:08,777 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 377 transitions. [2019-01-14 21:38:08,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:38:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 377 transitions. [2019-01-14 21:38:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 21:38:08,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:08,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:38:08,780 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash -795491305, now seen corresponding path program 1 times [2019-01-14 21:38:08,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:08,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:08,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:08,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:08,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:08,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:08,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:08,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 21:38:08,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:38:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:38:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:38:08,939 INFO L87 Difference]: Start difference. First operand 249 states and 377 transitions. Second operand 4 states. [2019-01-14 21:38:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:09,054 INFO L93 Difference]: Finished difference Result 449 states and 688 transitions. [2019-01-14 21:38:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:38:09,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 21:38:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:09,058 INFO L225 Difference]: With dead ends: 449 [2019-01-14 21:38:09,058 INFO L226 Difference]: Without dead ends: 447 [2019-01-14 21:38:09,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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 21:38:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-14 21:38:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 357. [2019-01-14 21:38:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-14 21:38:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 543 transitions. [2019-01-14 21:38:09,100 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 543 transitions. Word has length 14 [2019-01-14 21:38:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:09,100 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 543 transitions. [2019-01-14 21:38:09,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:38:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 543 transitions. [2019-01-14 21:38:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 21:38:09,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:09,102 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:09,104 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 592160614, now seen corresponding path program 1 times [2019-01-14 21:38:09,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:09,155 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 21:38:09,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:09,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:09,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:09,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:09,206 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 21:38:09,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:09,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 21:38:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:09,227 INFO L87 Difference]: Start difference. First operand 357 states and 543 transitions. Second operand 5 states. [2019-01-14 21:38:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:09,415 INFO L93 Difference]: Finished difference Result 610 states and 939 transitions. [2019-01-14 21:38:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:09,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-14 21:38:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:09,423 INFO L225 Difference]: With dead ends: 610 [2019-01-14 21:38:09,423 INFO L226 Difference]: Without dead ends: 608 [2019-01-14 21:38:09,424 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 21:38:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-01-14 21:38:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-01-14 21:38:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-14 21:38:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 701 transitions. [2019-01-14 21:38:09,450 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 701 transitions. Word has length 16 [2019-01-14 21:38:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:09,450 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 701 transitions. [2019-01-14 21:38:09,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2019-01-14 21:38:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 21:38:09,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:09,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 21:38:09,453 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1222343671, now seen corresponding path program 1 times [2019-01-14 21:38:09,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:09,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:09,518 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 21:38:09,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:09,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:09,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:09,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:09,545 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 21:38:09,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:09,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 21:38:09,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:38:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:38:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:38:09,574 INFO L87 Difference]: Start difference. First operand 464 states and 701 transitions. Second operand 4 states. [2019-01-14 21:38:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:09,849 INFO L93 Difference]: Finished difference Result 834 states and 1284 transitions. [2019-01-14 21:38:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 21:38:09,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-14 21:38:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:09,856 INFO L225 Difference]: With dead ends: 834 [2019-01-14 21:38:09,856 INFO L226 Difference]: Without dead ends: 832 [2019-01-14 21:38:09,858 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 21:38:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-01-14 21:38:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 668. [2019-01-14 21:38:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-01-14 21:38:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1007 transitions. [2019-01-14 21:38:09,896 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1007 transitions. Word has length 18 [2019-01-14 21:38:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:09,897 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 1007 transitions. [2019-01-14 21:38:09,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:38:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1007 transitions. [2019-01-14 21:38:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 21:38:09,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:09,898 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:38:09,901 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash -668230362, now seen corresponding path program 1 times [2019-01-14 21:38:09,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:09,995 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 21:38:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:09,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:10,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:10,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:10,076 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 21:38:10,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:10,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-14 21:38:10,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:10,100 INFO L87 Difference]: Start difference. First operand 668 states and 1007 transitions. Second operand 5 states. [2019-01-14 21:38:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:10,296 INFO L93 Difference]: Finished difference Result 1139 states and 1747 transitions. [2019-01-14 21:38:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:10,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-14 21:38:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:10,304 INFO L225 Difference]: With dead ends: 1139 [2019-01-14 21:38:10,304 INFO L226 Difference]: Without dead ends: 1137 [2019-01-14 21:38:10,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-01-14 21:38:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 871. [2019-01-14 21:38:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-01-14 21:38:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1297 transitions. [2019-01-14 21:38:10,350 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1297 transitions. Word has length 20 [2019-01-14 21:38:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:10,350 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1297 transitions. [2019-01-14 21:38:10,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1297 transitions. [2019-01-14 21:38:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 21:38:10,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:10,353 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 21:38:10,355 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:10,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:10,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2023206598, now seen corresponding path program 2 times [2019-01-14 21:38:10,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:10,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:10,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:10,451 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 21:38:10,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:10,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:10,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:10,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:10,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:10,513 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 21:38:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:10,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 21:38:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:10,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:10,546 INFO L87 Difference]: Start difference. First operand 871 states and 1297 transitions. Second operand 5 states. [2019-01-14 21:38:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:10,805 INFO L93 Difference]: Finished difference Result 1504 states and 2266 transitions. [2019-01-14 21:38:10,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:10,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 21:38:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:10,815 INFO L225 Difference]: With dead ends: 1504 [2019-01-14 21:38:10,815 INFO L226 Difference]: Without dead ends: 1502 [2019-01-14 21:38:10,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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 21:38:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-01-14 21:38:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1193. [2019-01-14 21:38:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-01-14 21:38:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1768 transitions. [2019-01-14 21:38:10,882 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1768 transitions. Word has length 21 [2019-01-14 21:38:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:10,888 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1768 transitions. [2019-01-14 21:38:10,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1768 transitions. [2019-01-14 21:38:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 21:38:10,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:10,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 21:38:10,895 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1092753757, now seen corresponding path program 1 times [2019-01-14 21:38:10,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:10,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:10,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:11,154 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 21:38:11,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:11,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:11,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:11,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:11,231 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 21:38:11,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:11,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 21:38:11,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:11,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:11,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:11,281 INFO L87 Difference]: Start difference. First operand 1193 states and 1768 transitions. Second operand 5 states. [2019-01-14 21:38:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:11,779 INFO L93 Difference]: Finished difference Result 1951 states and 2902 transitions. [2019-01-14 21:38:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:11,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-14 21:38:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:11,792 INFO L225 Difference]: With dead ends: 1951 [2019-01-14 21:38:11,792 INFO L226 Difference]: Without dead ends: 1950 [2019-01-14 21:38:11,796 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 21:38:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-01-14 21:38:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1429. [2019-01-14 21:38:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-01-14 21:38:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2114 transitions. [2019-01-14 21:38:11,878 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2114 transitions. Word has length 25 [2019-01-14 21:38:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:11,878 INFO L480 AbstractCegarLoop]: Abstraction has 1429 states and 2114 transitions. [2019-01-14 21:38:11,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2114 transitions. [2019-01-14 21:38:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 21:38:11,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:11,880 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-14 21:38:11,883 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1883170607, now seen corresponding path program 2 times [2019-01-14 21:38:11,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:11,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:12,142 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 21:38:12,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:12,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:12,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:12,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:12,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:12,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:12,220 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 21:38:12,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:12,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 21:38:12,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:12,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:12,258 INFO L87 Difference]: Start difference. First operand 1429 states and 2114 transitions. Second operand 5 states. [2019-01-14 21:38:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:12,817 INFO L93 Difference]: Finished difference Result 2462 states and 3693 transitions. [2019-01-14 21:38:12,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:12,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-14 21:38:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:12,840 INFO L225 Difference]: With dead ends: 2462 [2019-01-14 21:38:12,841 INFO L226 Difference]: Without dead ends: 2460 [2019-01-14 21:38:12,845 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 21:38:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-01-14 21:38:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1959. [2019-01-14 21:38:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-01-14 21:38:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2882 transitions. [2019-01-14 21:38:12,973 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2882 transitions. Word has length 27 [2019-01-14 21:38:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:12,973 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2882 transitions. [2019-01-14 21:38:12,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2882 transitions. [2019-01-14 21:38:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 21:38:12,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:12,979 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 21:38:12,979 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -748146377, now seen corresponding path program 3 times [2019-01-14 21:38:12,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:12,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:13,378 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 21:38:13,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:13,378 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:13,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:13,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:38:13,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:13,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:13,486 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 21:38:13,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:13,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:38:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:38:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:38:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:38:13,521 INFO L87 Difference]: Start difference. First operand 1959 states and 2882 transitions. Second operand 6 states. [2019-01-14 21:38:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:14,081 INFO L93 Difference]: Finished difference Result 3173 states and 4732 transitions. [2019-01-14 21:38:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:38:14,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 21:38:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:14,099 INFO L225 Difference]: With dead ends: 3173 [2019-01-14 21:38:14,099 INFO L226 Difference]: Without dead ends: 3171 [2019-01-14 21:38:14,103 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 21:38:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2019-01-14 21:38:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 2563. [2019-01-14 21:38:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-01-14 21:38:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3749 transitions. [2019-01-14 21:38:14,218 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3749 transitions. Word has length 28 [2019-01-14 21:38:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:14,218 INFO L480 AbstractCegarLoop]: Abstraction has 2563 states and 3749 transitions. [2019-01-14 21:38:14,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:38:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3749 transitions. [2019-01-14 21:38:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 21:38:14,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:14,222 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 21:38:14,223 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:14,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1682870728, now seen corresponding path program 1 times [2019-01-14 21:38:14,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:14,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:14,479 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 21:38:14,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:14,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:14,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:14,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:14,545 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 21:38:14,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:14,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 21:38:14,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:38:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:38:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:38:14,576 INFO L87 Difference]: Start difference. First operand 2563 states and 3749 transitions. Second operand 5 states. [2019-01-14 21:38:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:15,102 INFO L93 Difference]: Finished difference Result 4182 states and 6155 transitions. [2019-01-14 21:38:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:38:15,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-14 21:38:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:15,123 INFO L225 Difference]: With dead ends: 4182 [2019-01-14 21:38:15,123 INFO L226 Difference]: Without dead ends: 4181 [2019-01-14 21:38:15,128 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 21:38:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-01-14 21:38:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 3071. [2019-01-14 21:38:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-01-14 21:38:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4483 transitions. [2019-01-14 21:38:15,267 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4483 transitions. Word has length 31 [2019-01-14 21:38:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:15,267 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 4483 transitions. [2019-01-14 21:38:15,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:38:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4483 transitions. [2019-01-14 21:38:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 21:38:15,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:15,270 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 21:38:15,272 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:15,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1047523897, now seen corresponding path program 2 times [2019-01-14 21:38:15,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:15,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:15,640 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 21:38:15,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:15,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:15,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:15,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:15,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:15,690 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 21:38:15,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:38:15,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:38:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:38:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:38:15,718 INFO L87 Difference]: Start difference. First operand 3071 states and 4483 transitions. Second operand 6 states. [2019-01-14 21:38:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:16,198 INFO L93 Difference]: Finished difference Result 4727 states and 6947 transitions. [2019-01-14 21:38:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:38:16,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-14 21:38:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:16,222 INFO L225 Difference]: With dead ends: 4727 [2019-01-14 21:38:16,223 INFO L226 Difference]: Without dead ends: 4726 [2019-01-14 21:38:16,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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 21:38:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-01-14 21:38:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3459. [2019-01-14 21:38:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2019-01-14 21:38:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5047 transitions. [2019-01-14 21:38:16,366 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5047 transitions. Word has length 33 [2019-01-14 21:38:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:16,366 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 5047 transitions. [2019-01-14 21:38:16,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:38:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5047 transitions. [2019-01-14 21:38:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 21:38:16,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:16,371 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 21:38:16,371 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -507101786, now seen corresponding path program 4 times [2019-01-14 21:38:16,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:16,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:16,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:16,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:16,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:38:16,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:38:16,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:16,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:16,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:16,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:38:16,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:38:16,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:38:16,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:16,943 INFO L87 Difference]: Start difference. First operand 3459 states and 5047 transitions. Second operand 7 states. [2019-01-14 21:38:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:17,626 INFO L93 Difference]: Finished difference Result 5326 states and 7884 transitions. [2019-01-14 21:38:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:17,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-01-14 21:38:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:17,651 INFO L225 Difference]: With dead ends: 5326 [2019-01-14 21:38:17,651 INFO L226 Difference]: Without dead ends: 5324 [2019-01-14 21:38:17,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2019-01-14 21:38:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4377. [2019-01-14 21:38:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4377 states. [2019-01-14 21:38:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6353 transitions. [2019-01-14 21:38:17,841 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6353 transitions. Word has length 35 [2019-01-14 21:38:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:17,841 INFO L480 AbstractCegarLoop]: Abstraction has 4377 states and 6353 transitions. [2019-01-14 21:38:17,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:38:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6353 transitions. [2019-01-14 21:38:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 21:38:17,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:17,843 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-14 21:38:17,844 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:17,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash -32854327, now seen corresponding path program 3 times [2019-01-14 21:38:17,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:17,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:17,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:17,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:18,072 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 21:38:18,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:18,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:18,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:38:18,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:18,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:18,172 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 21:38:18,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:18,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:38:18,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:38:18,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:38:18,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:38:18,202 INFO L87 Difference]: Start difference. First operand 4377 states and 6353 transitions. Second operand 6 states. [2019-01-14 21:38:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:18,631 INFO L93 Difference]: Finished difference Result 7069 states and 10425 transitions. [2019-01-14 21:38:18,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:38:18,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-14 21:38:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:18,650 INFO L225 Difference]: With dead ends: 7069 [2019-01-14 21:38:18,651 INFO L226 Difference]: Without dead ends: 7067 [2019-01-14 21:38:18,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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 21:38:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2019-01-14 21:38:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 5729. [2019-01-14 21:38:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-01-14 21:38:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8265 transitions. [2019-01-14 21:38:18,854 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8265 transitions. Word has length 36 [2019-01-14 21:38:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:18,855 INFO L480 AbstractCegarLoop]: Abstraction has 5729 states and 8265 transitions. [2019-01-14 21:38:18,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:38:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8265 transitions. [2019-01-14 21:38:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 21:38:18,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:18,859 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-14 21:38:18,860 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:18,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1137071253, now seen corresponding path program 2 times [2019-01-14 21:38:18,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:18,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:18,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:18,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:19,008 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 21:38:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:19,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:19,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:19,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:19,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:19,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:19,044 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 21:38:19,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:19,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 21:38:19,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:38:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:38:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:38:19,063 INFO L87 Difference]: Start difference. First operand 5729 states and 8265 transitions. Second operand 6 states. [2019-01-14 21:38:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:19,345 INFO L93 Difference]: Finished difference Result 8806 states and 12809 transitions. [2019-01-14 21:38:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:38:19,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-14 21:38:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:19,365 INFO L225 Difference]: With dead ends: 8806 [2019-01-14 21:38:19,365 INFO L226 Difference]: Without dead ends: 8805 [2019-01-14 21:38:19,372 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 21:38:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2019-01-14 21:38:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 6453. [2019-01-14 21:38:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-01-14 21:38:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 9305 transitions. [2019-01-14 21:38:19,587 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 9305 transitions. Word has length 41 [2019-01-14 21:38:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:19,587 INFO L480 AbstractCegarLoop]: Abstraction has 6453 states and 9305 transitions. [2019-01-14 21:38:19,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:38:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 9305 transitions. [2019-01-14 21:38:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 21:38:19,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:19,591 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 21:38:19,591 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 589297713, now seen corresponding path program 3 times [2019-01-14 21:38:19,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:19,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:19,750 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 21:38:19,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:19,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:19,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 21:38:19,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:19,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:19,796 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 21:38:19,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:38:19,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:38:19,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:38:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:19,820 INFO L87 Difference]: Start difference. First operand 6453 states and 9305 transitions. Second operand 7 states. [2019-01-14 21:38:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:20,068 INFO L93 Difference]: Finished difference Result 9500 states and 13815 transitions. [2019-01-14 21:38:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:20,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-14 21:38:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:20,089 INFO L225 Difference]: With dead ends: 9500 [2019-01-14 21:38:20,089 INFO L226 Difference]: Without dead ends: 9499 [2019-01-14 21:38:20,097 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 21:38:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2019-01-14 21:38:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 7025. [2019-01-14 21:38:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2019-01-14 21:38:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 10131 transitions. [2019-01-14 21:38:20,447 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 10131 transitions. Word has length 41 [2019-01-14 21:38:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:20,447 INFO L480 AbstractCegarLoop]: Abstraction has 7025 states and 10131 transitions. [2019-01-14 21:38:20,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:38:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 10131 transitions. [2019-01-14 21:38:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 21:38:20,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:20,451 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 21:38:20,452 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 644163159, now seen corresponding path program 5 times [2019-01-14 21:38:20,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:20,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:20,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:20,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:20,634 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 21:38:20,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:20,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:20,647 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:38:20,671 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 21:38:20,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:20,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:20,681 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 21:38:20,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:20,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:38:20,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:20,705 INFO L87 Difference]: Start difference. First operand 7025 states and 10131 transitions. Second operand 8 states. [2019-01-14 21:38:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:20,955 INFO L93 Difference]: Finished difference Result 10381 states and 15206 transitions. [2019-01-14 21:38:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:38:20,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-14 21:38:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:20,977 INFO L225 Difference]: With dead ends: 10381 [2019-01-14 21:38:20,977 INFO L226 Difference]: Without dead ends: 10379 [2019-01-14 21:38:20,986 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 21:38:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-01-14 21:38:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 8665. [2019-01-14 21:38:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-01-14 21:38:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 12438 transitions. [2019-01-14 21:38:21,274 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 12438 transitions. Word has length 42 [2019-01-14 21:38:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:21,275 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 12438 transitions. [2019-01-14 21:38:21,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 12438 transitions. [2019-01-14 21:38:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 21:38:21,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:21,277 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-14 21:38:21,278 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash -809708433, now seen corresponding path program 4 times [2019-01-14 21:38:21,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:21,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:21,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:21,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:21,403 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 21:38:21,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:21,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:21,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:38:21,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:38:21,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:21,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:21,450 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 21:38:21,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:21,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:38:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:38:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:38:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:21,473 INFO L87 Difference]: Start difference. First operand 8665 states and 12438 transitions. Second operand 7 states. [2019-01-14 21:38:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:21,720 INFO L93 Difference]: Finished difference Result 13312 states and 19429 transitions. [2019-01-14 21:38:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:21,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-01-14 21:38:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:21,736 INFO L225 Difference]: With dead ends: 13312 [2019-01-14 21:38:21,736 INFO L226 Difference]: Without dead ends: 13310 [2019-01-14 21:38:21,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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 21:38:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-01-14 21:38:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10967. [2019-01-14 21:38:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-01-14 21:38:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15657 transitions. [2019-01-14 21:38:22,139 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15657 transitions. Word has length 45 [2019-01-14 21:38:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 10967 states and 15657 transitions. [2019-01-14 21:38:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:38:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15657 transitions. [2019-01-14 21:38:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 21:38:22,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:22,142 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 21:38:22,143 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash -144620410, now seen corresponding path program 6 times [2019-01-14 21:38:22,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:22,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:22,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:22,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:22,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:22,284 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 21:38:22,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:22,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:22,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:38:22,315 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 21:38:22,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:22,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:22,328 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 21:38:22,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:22,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 21:38:22,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:38:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:38:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:22,347 INFO L87 Difference]: Start difference. First operand 10967 states and 15657 transitions. Second operand 9 states. [2019-01-14 21:38:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:22,636 INFO L93 Difference]: Finished difference Result 15622 states and 22665 transitions. [2019-01-14 21:38:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:38:22,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-01-14 21:38:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:22,654 INFO L225 Difference]: With dead ends: 15622 [2019-01-14 21:38:22,654 INFO L226 Difference]: Without dead ends: 15620 [2019-01-14 21:38:22,660 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 21:38:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-01-14 21:38:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 13091. [2019-01-14 21:38:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13091 states. [2019-01-14 21:38:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13091 states to 13091 states and 18609 transitions. [2019-01-14 21:38:23,005 INFO L78 Accepts]: Start accepts. Automaton has 13091 states and 18609 transitions. Word has length 49 [2019-01-14 21:38:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:23,005 INFO L480 AbstractCegarLoop]: Abstraction has 13091 states and 18609 transitions. [2019-01-14 21:38:23,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:38:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13091 states and 18609 transitions. [2019-01-14 21:38:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-14 21:38:23,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:23,008 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 21:38:23,008 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:23,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2004605083, now seen corresponding path program 4 times [2019-01-14 21:38:23,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:23,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:23,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:23,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 21:38:23,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:38:23,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:38:23,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:23,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:38:23,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:23,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:38:23,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:23,166 INFO L87 Difference]: Start difference. First operand 13091 states and 18609 transitions. Second operand 8 states. [2019-01-14 21:38:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:23,559 INFO L93 Difference]: Finished difference Result 19890 states and 28521 transitions. [2019-01-14 21:38:23,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:38:23,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-14 21:38:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:23,581 INFO L225 Difference]: With dead ends: 19890 [2019-01-14 21:38:23,582 INFO L226 Difference]: Without dead ends: 19889 [2019-01-14 21:38:23,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 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 21:38:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19889 states. [2019-01-14 21:38:24,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19889 to 14129. [2019-01-14 21:38:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2019-01-14 21:38:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 20097 transitions. [2019-01-14 21:38:24,063 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 20097 transitions. Word has length 49 [2019-01-14 21:38:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:24,063 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 20097 transitions. [2019-01-14 21:38:24,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 20097 transitions. [2019-01-14 21:38:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 21:38:24,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:24,066 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-14 21:38:24,067 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:24,067 INFO L82 PathProgramCache]: Analyzing trace with hash -85375778, now seen corresponding path program 3 times [2019-01-14 21:38:24,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:24,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:24,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:24,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:24,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:24,165 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 21:38:24,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:24,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 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 21:38:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:24,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-14 21:38:24,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:24,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:24,233 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 21:38:24,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:24,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 21:38:24,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:38:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:38:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:38:24,263 INFO L87 Difference]: Start difference. First operand 14129 states and 20097 transitions. Second operand 7 states. [2019-01-14 21:38:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:24,736 INFO L93 Difference]: Finished difference Result 20774 states and 29837 transitions. [2019-01-14 21:38:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:38:24,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-14 21:38:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:24,761 INFO L225 Difference]: With dead ends: 20774 [2019-01-14 21:38:24,761 INFO L226 Difference]: Without dead ends: 20773 [2019-01-14 21:38:24,771 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 21:38:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20773 states. [2019-01-14 21:38:25,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20773 to 15381. [2019-01-14 21:38:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15381 states. [2019-01-14 21:38:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15381 states to 15381 states and 21881 transitions. [2019-01-14 21:38:25,162 INFO L78 Accepts]: Start accepts. Automaton has 15381 states and 21881 transitions. Word has length 51 [2019-01-14 21:38:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:25,162 INFO L480 AbstractCegarLoop]: Abstraction has 15381 states and 21881 transitions. [2019-01-14 21:38:25,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:38:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 15381 states and 21881 transitions. [2019-01-14 21:38:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 21:38:25,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:25,165 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-14 21:38:25,166 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:25,167 INFO L82 PathProgramCache]: Analyzing trace with hash -884758135, now seen corresponding path program 5 times [2019-01-14 21:38:25,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:25,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:25,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:25,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:25,365 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 21:38:25,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:25,365 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 21:38:25,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:38:25,391 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 21:38:25,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:25,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:25,399 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 21:38:25,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:25,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:38:25,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:25,418 INFO L87 Difference]: Start difference. First operand 15381 states and 21881 transitions. Second operand 8 states. [2019-01-14 21:38:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:25,971 INFO L93 Difference]: Finished difference Result 22697 states and 32841 transitions. [2019-01-14 21:38:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:38:25,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-14 21:38:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:25,995 INFO L225 Difference]: With dead ends: 22697 [2019-01-14 21:38:25,995 INFO L226 Difference]: Without dead ends: 22695 [2019-01-14 21:38:26,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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 21:38:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22695 states. [2019-01-14 21:38:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22695 to 18973. [2019-01-14 21:38:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-01-14 21:38:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 26864 transitions. [2019-01-14 21:38:26,447 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 26864 transitions. Word has length 54 [2019-01-14 21:38:26,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:26,447 INFO L480 AbstractCegarLoop]: Abstraction has 18973 states and 26864 transitions. [2019-01-14 21:38:26,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 26864 transitions. [2019-01-14 21:38:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-14 21:38:26,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:26,450 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 21:38:26,450 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -931224713, now seen corresponding path program 7 times [2019-01-14 21:38:26,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:26,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:26,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:26,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:27,114 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 21:38:27,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:27,115 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 21:38:27,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:27,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:27,169 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 21:38:27,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:27,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:38:27,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:38:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:38:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:38:27,200 INFO L87 Difference]: Start difference. First operand 18973 states and 26864 transitions. Second operand 10 states. [2019-01-14 21:38:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:27,834 INFO L93 Difference]: Finished difference Result 26251 states and 37778 transitions. [2019-01-14 21:38:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:38:27,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-14 21:38:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:27,868 INFO L225 Difference]: With dead ends: 26251 [2019-01-14 21:38:27,868 INFO L226 Difference]: Without dead ends: 26249 [2019-01-14 21:38:27,877 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 21:38:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26249 states. [2019-01-14 21:38:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26249 to 22311. [2019-01-14 21:38:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-01-14 21:38:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 31473 transitions. [2019-01-14 21:38:28,773 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 31473 transitions. Word has length 56 [2019-01-14 21:38:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:28,774 INFO L480 AbstractCegarLoop]: Abstraction has 22311 states and 31473 transitions. [2019-01-14 21:38:28,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:38:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 31473 transitions. [2019-01-14 21:38:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 21:38:28,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:28,777 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 21:38:28,778 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2041729275, now seen corresponding path program 5 times [2019-01-14 21:38:28,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:28,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:28,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:28,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:28,923 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 21:38:28,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:28,924 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 21:38:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:38:28,952 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 21:38:28,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:28,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:28,961 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 21:38:28,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 21:38:28,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:38:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:38:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:28,980 INFO L87 Difference]: Start difference. First operand 22311 states and 31473 transitions. Second operand 9 states. [2019-01-14 21:38:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:29,698 INFO L93 Difference]: Finished difference Result 32955 states and 46932 transitions. [2019-01-14 21:38:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:38:29,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-14 21:38:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:29,745 INFO L225 Difference]: With dead ends: 32955 [2019-01-14 21:38:29,745 INFO L226 Difference]: Without dead ends: 32954 [2019-01-14 21:38:29,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 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 21:38:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32954 states. [2019-01-14 21:38:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32954 to 23705. [2019-01-14 21:38:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23705 states. [2019-01-14 21:38:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23705 states to 23705 states and 33462 transitions. [2019-01-14 21:38:30,378 INFO L78 Accepts]: Start accepts. Automaton has 23705 states and 33462 transitions. Word has length 57 [2019-01-14 21:38:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:30,378 INFO L480 AbstractCegarLoop]: Abstraction has 23705 states and 33462 transitions. [2019-01-14 21:38:30,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:38:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23705 states and 33462 transitions. [2019-01-14 21:38:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 21:38:30,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:30,382 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-14 21:38:30,382 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2087316113, now seen corresponding path program 4 times [2019-01-14 21:38:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:30,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:30,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:30,500 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 21:38:30,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:30,500 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 21:38:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:38:30,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:38:30,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:30,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:30,542 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 21:38:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:38:30,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:38:30,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:38:30,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:38:30,563 INFO L87 Difference]: Start difference. First operand 23705 states and 33462 transitions. Second operand 8 states. [2019-01-14 21:38:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:31,462 INFO L93 Difference]: Finished difference Result 33669 states and 48018 transitions. [2019-01-14 21:38:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 21:38:31,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-14 21:38:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:31,500 INFO L225 Difference]: With dead ends: 33669 [2019-01-14 21:38:31,500 INFO L226 Difference]: Without dead ends: 33668 [2019-01-14 21:38:31,508 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 21:38:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-01-14 21:38:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 25269. [2019-01-14 21:38:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25269 states. [2019-01-14 21:38:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25269 states to 25269 states and 35684 transitions. [2019-01-14 21:38:32,127 INFO L78 Accepts]: Start accepts. Automaton has 25269 states and 35684 transitions. Word has length 61 [2019-01-14 21:38:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:32,127 INFO L480 AbstractCegarLoop]: Abstraction has 25269 states and 35684 transitions. [2019-01-14 21:38:32,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:38:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25269 states and 35684 transitions. [2019-01-14 21:38:32,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 21:38:32,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:32,131 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 21:38:32,131 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1714864998, now seen corresponding path program 8 times [2019-01-14 21:38:32,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:32,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:32,311 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 21:38:32,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:32,312 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 21:38:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:32,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:32,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:32,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:32,353 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 21:38:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 21:38:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:38:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:38:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:38:32,382 INFO L87 Difference]: Start difference. First operand 25269 states and 35684 transitions. Second operand 11 states. [2019-01-14 21:38:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:33,132 INFO L93 Difference]: Finished difference Result 34130 states and 48968 transitions. [2019-01-14 21:38:33,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:38:33,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-01-14 21:38:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:33,169 INFO L225 Difference]: With dead ends: 34130 [2019-01-14 21:38:33,169 INFO L226 Difference]: Without dead ends: 34128 [2019-01-14 21:38:33,178 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 21:38:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2019-01-14 21:38:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 29345. [2019-01-14 21:38:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29345 states. [2019-01-14 21:38:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29345 states to 29345 states and 41306 transitions. [2019-01-14 21:38:34,367 INFO L78 Accepts]: Start accepts. Automaton has 29345 states and 41306 transitions. Word has length 63 [2019-01-14 21:38:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:34,368 INFO L480 AbstractCegarLoop]: Abstraction has 29345 states and 41306 transitions. [2019-01-14 21:38:34,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:38:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29345 states and 41306 transitions. [2019-01-14 21:38:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 21:38:34,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:34,374 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-14 21:38:34,376 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1360130479, now seen corresponding path program 6 times [2019-01-14 21:38:34,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:34,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:34,822 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 21:38:34,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:34,823 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 21:38:34,833 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:38:34,863 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 21:38:34,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:34,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:34,874 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 21:38:34,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:34,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 21:38:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:38:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:38:34,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:34,900 INFO L87 Difference]: Start difference. First operand 29345 states and 41306 transitions. Second operand 9 states. [2019-01-14 21:38:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:35,637 INFO L93 Difference]: Finished difference Result 41880 states and 59971 transitions. [2019-01-14 21:38:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:38:35,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-01-14 21:38:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:35,682 INFO L225 Difference]: With dead ends: 41880 [2019-01-14 21:38:35,682 INFO L226 Difference]: Without dead ends: 41878 [2019-01-14 21:38:35,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41878 states. [2019-01-14 21:38:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41878 to 35465. [2019-01-14 21:38:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-01-14 21:38:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 49718 transitions. [2019-01-14 21:38:36,549 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 49718 transitions. Word has length 63 [2019-01-14 21:38:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:36,549 INFO L480 AbstractCegarLoop]: Abstraction has 35465 states and 49718 transitions. [2019-01-14 21:38:36,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:38:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 49718 transitions. [2019-01-14 21:38:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-14 21:38:36,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:36,554 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 21:38:36,555 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:36,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash -851477649, now seen corresponding path program 6 times [2019-01-14 21:38:36,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:36,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:36,933 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 21:38:36,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:36,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 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 21:38:36,946 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:38:36,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 21:38:36,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:36,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:36,981 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 21:38:37,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:37,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:38:37,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:38:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:38:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:38:37,001 INFO L87 Difference]: Start difference. First operand 35465 states and 49718 transitions. Second operand 10 states. [2019-01-14 21:38:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:38,321 INFO L93 Difference]: Finished difference Result 51129 states and 72397 transitions. [2019-01-14 21:38:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:38:38,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-14 21:38:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:38,383 INFO L225 Difference]: With dead ends: 51129 [2019-01-14 21:38:38,383 INFO L226 Difference]: Without dead ends: 51128 [2019-01-14 21:38:38,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:38:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51128 states. [2019-01-14 21:38:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51128 to 37261. [2019-01-14 21:38:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-01-14 21:38:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 52271 transitions. [2019-01-14 21:38:39,402 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 52271 transitions. Word has length 65 [2019-01-14 21:38:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:39,402 INFO L480 AbstractCegarLoop]: Abstraction has 37261 states and 52271 transitions. [2019-01-14 21:38:39,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:38:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 52271 transitions. [2019-01-14 21:38:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 21:38:39,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:39,407 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 21:38:39,408 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1457084265, now seen corresponding path program 9 times [2019-01-14 21:38:39,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:39,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:39,564 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 21:38:39,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:39,564 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 21:38:39,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:39,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 21:38:39,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:39,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:39,618 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 21:38:39,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:39,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:38:39,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:38:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:38:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:38:39,637 INFO L87 Difference]: Start difference. First operand 37261 states and 52271 transitions. Second operand 12 states. [2019-01-14 21:38:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:40,578 INFO L93 Difference]: Finished difference Result 49299 states and 70254 transitions. [2019-01-14 21:38:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:38:40,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-01-14 21:38:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:40,635 INFO L225 Difference]: With dead ends: 49299 [2019-01-14 21:38:40,635 INFO L226 Difference]: Without dead ends: 49297 [2019-01-14 21:38:40,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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 21:38:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49297 states. [2019-01-14 21:38:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49297 to 42813. [2019-01-14 21:38:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2019-01-14 21:38:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 59889 transitions. [2019-01-14 21:38:42,247 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 59889 transitions. Word has length 70 [2019-01-14 21:38:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:42,248 INFO L480 AbstractCegarLoop]: Abstraction has 42813 states and 59889 transitions. [2019-01-14 21:38:42,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:38:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 59889 transitions. [2019-01-14 21:38:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 21:38:42,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:42,253 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-14 21:38:42,254 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:42,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1593226108, now seen corresponding path program 5 times [2019-01-14 21:38:42,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:42,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:42,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:42,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:42,355 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 21:38:42,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:42,356 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 21:38:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 21:38:42,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 21:38:42,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:42,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:42,409 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 21:38:42,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:42,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 21:38:42,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 21:38:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 21:38:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 21:38:42,428 INFO L87 Difference]: Start difference. First operand 42813 states and 59889 transitions. Second operand 9 states. [2019-01-14 21:38:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:43,487 INFO L93 Difference]: Finished difference Result 59102 states and 83563 transitions. [2019-01-14 21:38:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:38:43,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-14 21:38:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:43,555 INFO L225 Difference]: With dead ends: 59102 [2019-01-14 21:38:43,555 INFO L226 Difference]: Without dead ends: 59101 [2019-01-14 21:38:43,570 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 21:38:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59101 states. [2019-01-14 21:38:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59101 to 45005. [2019-01-14 21:38:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45005 states. [2019-01-14 21:38:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45005 states to 45005 states and 62987 transitions. [2019-01-14 21:38:44,734 INFO L78 Accepts]: Start accepts. Automaton has 45005 states and 62987 transitions. Word has length 71 [2019-01-14 21:38:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:44,734 INFO L480 AbstractCegarLoop]: Abstraction has 45005 states and 62987 transitions. [2019-01-14 21:38:44,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 21:38:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 45005 states and 62987 transitions. [2019-01-14 21:38:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 21:38:44,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:44,741 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-14 21:38:44,741 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1572566089, now seen corresponding path program 7 times [2019-01-14 21:38:44,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:44,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:44,900 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 21:38:44,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:44,900 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 21:38:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:44,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:44,936 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 21:38:44,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:44,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:38:44,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:38:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:38:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:38:44,955 INFO L87 Difference]: Start difference. First operand 45005 states and 62987 transitions. Second operand 10 states. [2019-01-14 21:38:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:46,284 INFO L93 Difference]: Finished difference Result 62465 states and 88920 transitions. [2019-01-14 21:38:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:38:46,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-01-14 21:38:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:46,355 INFO L225 Difference]: With dead ends: 62465 [2019-01-14 21:38:46,355 INFO L226 Difference]: Without dead ends: 62463 [2019-01-14 21:38:46,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 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 21:38:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62463 states. [2019-01-14 21:38:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62463 to 53489. [2019-01-14 21:38:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-01-14 21:38:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 74598 transitions. [2019-01-14 21:38:47,694 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 74598 transitions. Word has length 72 [2019-01-14 21:38:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:47,694 INFO L480 AbstractCegarLoop]: Abstraction has 53489 states and 74598 transitions. [2019-01-14 21:38:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:38:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 74598 transitions. [2019-01-14 21:38:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 21:38:47,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:47,700 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 21:38:47,702 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2147171801, now seen corresponding path program 7 times [2019-01-14 21:38:47,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:47,874 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 21:38:47,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:47,874 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 21:38:47,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:47,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:47,921 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 21:38:47,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 21:38:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:38:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:38:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:38:47,943 INFO L87 Difference]: Start difference. First operand 53489 states and 74598 transitions. Second operand 11 states. [2019-01-14 21:38:49,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:49,566 INFO L93 Difference]: Finished difference Result 75498 states and 106380 transitions. [2019-01-14 21:38:49,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:38:49,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-01-14 21:38:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:49,657 INFO L225 Difference]: With dead ends: 75498 [2019-01-14 21:38:49,657 INFO L226 Difference]: Without dead ends: 75497 [2019-01-14 21:38:49,675 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 21:38:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75497 states. [2019-01-14 21:38:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75497 to 55733. [2019-01-14 21:38:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55733 states. [2019-01-14 21:38:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55733 states to 55733 states and 77778 transitions. [2019-01-14 21:38:51,416 INFO L78 Accepts]: Start accepts. Automaton has 55733 states and 77778 transitions. Word has length 73 [2019-01-14 21:38:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:51,417 INFO L480 AbstractCegarLoop]: Abstraction has 55733 states and 77778 transitions. [2019-01-14 21:38:51,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:38:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 55733 states and 77778 transitions. [2019-01-14 21:38:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-14 21:38:51,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:51,426 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1] [2019-01-14 21:38:51,426 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1519696454, now seen corresponding path program 10 times [2019-01-14 21:38:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:51,906 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 21:38:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:51,907 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 21:38:52,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:38:52,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:38:52,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:52,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:53,218 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 21:38:53,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 21:38:53,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 23 [2019-01-14 21:38:53,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 21:38:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 21:38:53,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 21:38:53,242 INFO L87 Difference]: Start difference. First operand 55733 states and 77778 transitions. Second operand 24 states. [2019-01-14 21:38:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:57,510 INFO L93 Difference]: Finished difference Result 74710 states and 103067 transitions. [2019-01-14 21:38:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-14 21:38:57,511 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-14 21:38:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:57,514 INFO L225 Difference]: With dead ends: 74710 [2019-01-14 21:38:57,514 INFO L226 Difference]: Without dead ends: 1364 [2019-01-14 21:38:57,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2234, Invalid=5776, Unknown=0, NotChecked=0, Total=8010 [2019-01-14 21:38:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-01-14 21:38:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 585. [2019-01-14 21:38:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-01-14 21:38:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 700 transitions. [2019-01-14 21:38:57,596 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 700 transitions. Word has length 77 [2019-01-14 21:38:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:57,596 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 700 transitions. [2019-01-14 21:38:57,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 21:38:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 700 transitions. [2019-01-14 21:38:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 21:38:57,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:57,598 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-14 21:38:57,598 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:57,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1093517585, now seen corresponding path program 8 times [2019-01-14 21:38:57,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:57,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:57,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:57,732 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 21:38:57,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:57,733 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 21:38:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:57,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:57,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:57,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:57,779 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 21:38:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 21:38:57,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:38:57,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:38:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:38:57,798 INFO L87 Difference]: Start difference. First operand 585 states and 700 transitions. Second operand 11 states. [2019-01-14 21:38:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:57,887 INFO L93 Difference]: Finished difference Result 701 states and 822 transitions. [2019-01-14 21:38:57,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:38:57,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-01-14 21:38:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:57,889 INFO L225 Difference]: With dead ends: 701 [2019-01-14 21:38:57,889 INFO L226 Difference]: Without dead ends: 587 [2019-01-14 21:38:57,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 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 21:38:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-14 21:38:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 481. [2019-01-14 21:38:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-14 21:38:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 563 transitions. [2019-01-14 21:38:57,908 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 563 transitions. Word has length 81 [2019-01-14 21:38:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:57,909 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 563 transitions. [2019-01-14 21:38:57,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:38:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 563 transitions. [2019-01-14 21:38:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 21:38:57,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:57,910 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-14 21:38:57,911 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash -944170313, now seen corresponding path program 6 times [2019-01-14 21:38:57,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:57,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:57,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:57,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:57,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:58,048 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 21:38:58,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:58,048 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 21:38:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 21:38:58,093 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 21:38:58,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:58,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:58,105 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 21:38:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:58,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 21:38:58,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 21:38:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 21:38:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 21:38:58,125 INFO L87 Difference]: Start difference. First operand 481 states and 563 transitions. Second operand 10 states. [2019-01-14 21:38:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:58,221 INFO L93 Difference]: Finished difference Result 546 states and 639 transitions. [2019-01-14 21:38:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:38:58,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-01-14 21:38:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:58,224 INFO L225 Difference]: With dead ends: 546 [2019-01-14 21:38:58,224 INFO L226 Difference]: Without dead ends: 379 [2019-01-14 21:38:58,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 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 21:38:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-14 21:38:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-01-14 21:38:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-01-14 21:38:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 417 transitions. [2019-01-14 21:38:58,239 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 417 transitions. Word has length 81 [2019-01-14 21:38:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:58,239 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 417 transitions. [2019-01-14 21:38:58,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 21:38:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 417 transitions. [2019-01-14 21:38:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 21:38:58,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:58,240 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 21:38:58,241 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2010450365, now seen corresponding path program 8 times [2019-01-14 21:38:58,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:58,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:58,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:58,467 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 21:38:58,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:58,468 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 21:38:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:58,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:58,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:58,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:58,514 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 21:38:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:38:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:38:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:38:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:38:58,533 INFO L87 Difference]: Start difference. First operand 379 states and 417 transitions. Second operand 12 states. [2019-01-14 21:38:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:58,595 INFO L93 Difference]: Finished difference Result 464 states and 501 transitions. [2019-01-14 21:38:58,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:38:58,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-01-14 21:38:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:58,598 INFO L225 Difference]: With dead ends: 464 [2019-01-14 21:38:58,598 INFO L226 Difference]: Without dead ends: 397 [2019-01-14 21:38:58,599 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 21:38:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-14 21:38:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 306. [2019-01-14 21:38:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-14 21:38:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2019-01-14 21:38:58,614 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 81 [2019-01-14 21:38:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:58,614 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2019-01-14 21:38:58,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:38:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2019-01-14 21:38:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-14 21:38:58,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:58,616 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-14 21:38:58,616 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1856106743, now seen corresponding path program 9 times [2019-01-14 21:38:58,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:58,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:58,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:58,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:59,114 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 21:38:59,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:59,115 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 21:38:59,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:38:59,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 21:38:59,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:59,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:59,172 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 21:38:59,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:38:59,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:38:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:38:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:38:59,194 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand 12 states. [2019-01-14 21:38:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:59,248 INFO L93 Difference]: Finished difference Result 319 states and 357 transitions. [2019-01-14 21:38:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:38:59,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-14 21:38:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:59,250 INFO L225 Difference]: With dead ends: 319 [2019-01-14 21:38:59,250 INFO L226 Difference]: Without dead ends: 242 [2019-01-14 21:38:59,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:38:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-14 21:38:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2019-01-14 21:38:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-14 21:38:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2019-01-14 21:38:59,260 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 90 [2019-01-14 21:38:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:59,260 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2019-01-14 21:38:59,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:38:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2019-01-14 21:38:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-14 21:38:59,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:59,261 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-14 21:38:59,261 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1359938858, now seen corresponding path program 7 times [2019-01-14 21:38:59,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:59,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:38:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:59,529 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 21:38:59,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:59,529 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 21:38:59,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:59,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:59,578 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 21:38:59,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 21:38:59,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 21:38:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 21:38:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 21:38:59,597 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand 11 states. [2019-01-14 21:38:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:38:59,652 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2019-01-14 21:38:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 21:38:59,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-01-14 21:38:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:38:59,655 INFO L225 Difference]: With dead ends: 243 [2019-01-14 21:38:59,655 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 21:38:59,655 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 21:38:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 21:38:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-14 21:38:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 21:38:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 101 transitions. [2019-01-14 21:38:59,661 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 101 transitions. Word has length 91 [2019-01-14 21:38:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:38:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 101 transitions. [2019-01-14 21:38:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 21:38:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 101 transitions. [2019-01-14 21:38:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 21:38:59,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:38:59,662 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-14 21:38:59,663 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:38:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:38:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -498811939, now seen corresponding path program 8 times [2019-01-14 21:38:59,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:38:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:38:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:59,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:38:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:38:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:38:59,912 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 21:38:59,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:38:59,912 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 21:38:59,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:38:59,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:38:59,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:38:59,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:38:59,965 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 21:38:59,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:38:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 21:38:59,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:38:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:38:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:38:59,984 INFO L87 Difference]: Start difference. First operand 102 states and 101 transitions. Second operand 12 states. [2019-01-14 21:39:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:39:00,016 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2019-01-14 21:39:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:39:00,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-01-14 21:39:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:39:00,018 INFO L225 Difference]: With dead ends: 102 [2019-01-14 21:39:00,018 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:39:00,019 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 21:39:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:39:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:39:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:39:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:39:00,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-01-14 21:39:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:39:00,019 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:39:00,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:39:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:39:00,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:39:00,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:39:00,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:00,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:00,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:01,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:02,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:03,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:05,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:06,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:07,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:08,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:09,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:09,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:09,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:09,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:09,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:10,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:12,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:12,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:12,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:13,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:13,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:13,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:14,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:14,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:15,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:15,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:15,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:16,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:17,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:18,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:18,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:18,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:19,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:19,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:19,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:19,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:19,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:20,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:20,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:20,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:21,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:24,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:24,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:24,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:26,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:27,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:28,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:30,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:32,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:32,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:32,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:33,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:33,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:33,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:37,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:41,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:45,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:46,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:48,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:51,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:58,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:39:58,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:01,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:04,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 21:40:04,891 WARN L181 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 4654 DAG size of output: 3109 [2019-01-14 21:42:17,976 WARN L181 SmtUtils]: Spent 2.22 m on a formula simplification. DAG size of input: 2580 DAG size of output: 409 [2019-01-14 21:42:17,992 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-01-14 21:42:17,992 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 21:42:17,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 21:42:17,994 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-14 21:42:17,995 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-14 21:42:17,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:42:17,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-14 21:42:17,995 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-14 21:42:17,995 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L451 ceAbstractionStarter]: At program point L34(lines 13 35) the Hoare annotation is: true [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2019-01-14 21:42:17,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-14 21:42:18,001 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 21:42:18,001 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 21:42:18,001 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 21:42:18,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:42:18 BoogieIcfgContainer [2019-01-14 21:42:18,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:42:18,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:42:18,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:42:18,102 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:42:18,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:38:07" (3/4) ... [2019-01-14 21:42:18,108 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:42:18,120 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 21:42:18,120 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:42:18,189 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:42:18,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:42:18,190 INFO L168 Benchmark]: Toolchain (without parser) took 252035.43 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 951.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-14 21:42:18,191 INFO L168 Benchmark]: CDTParser took 0.15 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 21:42:18,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.31 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 21:42:18,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.75 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 21:42:18,195 INFO L168 Benchmark]: Boogie Preprocessor took 33.77 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 21:42:18,195 INFO L168 Benchmark]: RCFGBuilder took 557.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -91.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:42:18,196 INFO L168 Benchmark]: TraceAbstraction took 251039.29 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-01-14 21:42:18,197 INFO L168 Benchmark]: Witness Printer took 88.85 ms. Allocated memory is still 4.9 GB. Free memory is still 2.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:42:18,204 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.15 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 264.31 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 44.75 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 33.77 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 557.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -91.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 251039.29 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 88.85 ms. Allocated memory is still 4.9 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: 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: 20]: 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: 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: 20]: 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, 250.8s OverallTime, 44 OverallIterations, 11 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 197.9s 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, 10.5s 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, 64.8s HoareSimplificationTime, 2 FomulaSimplificationsInter, 133427 FormulaSimplificationTreeSizeReductionInter, 133.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.5s 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...