./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b0a853f0131530f88013a3fcfdf4f133f41c0569 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:47:34,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:47:34,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:47:34,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:47:34,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:47:34,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:47:34,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:47:34,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:47:34,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:47:34,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:47:34,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:47:34,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:47:34,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:47:34,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:47:34,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:47:34,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:47:34,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:47:34,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:47:34,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:47:34,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:47:34,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:47:34,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:47:34,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:47:34,143 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:47:34,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:47:34,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:47:34,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:47:34,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:47:34,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:47:34,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:47:34,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:47:34,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:47:34,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:47:34,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:47:34,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:47:34,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:47:34,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:47:34,169 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:47:34,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:47:34,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:47:34,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:47:34,171 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:47:34,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:47:34,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:47:34,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:47:34,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:47:34,173 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:47:34,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:47:34,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:47:34,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:47:34,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:47:34,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:47:34,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:47:34,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:47:34,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:47:34,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:47:34,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:47:34,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:47:34,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:47:34,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a853f0131530f88013a3fcfdf4f133f41c0569 [2019-01-01 20:47:34,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:47:34,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:47:34,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:47:34,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:47:34,253 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:47:34,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-01 20:47:34,328 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb3f3ee/8de5c18d3c6f4a15ba973b767d25ec57/FLAGb70d6f655 [2019-01-01 20:47:34,774 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:47:34,775 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-01 20:47:34,783 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb3f3ee/8de5c18d3c6f4a15ba973b767d25ec57/FLAGb70d6f655 [2019-01-01 20:47:35,161 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bb3f3ee/8de5c18d3c6f4a15ba973b767d25ec57 [2019-01-01 20:47:35,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:47:35,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:47:35,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:35,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:47:35,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:47:35,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35, skipping insertion in model container [2019-01-01 20:47:35,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:47:35,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:47:35,393 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:35,398 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:47:35,419 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:47:35,435 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:47:35,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35 WrapperNode [2019-01-01 20:47:35,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:47:35,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:35,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:47:35,437 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:47:35,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:47:35,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:47:35,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:47:35,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:47:35,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (1/1) ... [2019-01-01 20:47:35,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:47:35,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:47:35,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:47:35,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:47:35,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (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-01 20:47:35,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:47:35,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:47:36,027 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:47:36,027 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 20:47:36,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:36 BoogieIcfgContainer [2019-01-01 20:47:36,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:47:36,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:47:36,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:47:36,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:47:36,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:47:35" (1/3) ... [2019-01-01 20:47:36,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d609ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:36, skipping insertion in model container [2019-01-01 20:47:36,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:47:35" (2/3) ... [2019-01-01 20:47:36,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d609ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:47:36, skipping insertion in model container [2019-01-01 20:47:36,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:36" (3/3) ... [2019-01-01 20:47:36,035 INFO L112 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-random2d_true-termination_true-no-overflow.c [2019-01-01 20:47:36,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:47:36,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-01 20:47:36,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-01 20:47:36,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:47:36,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:47:36,099 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:47:36,099 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:47:36,099 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:47:36,099 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:47:36,100 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:47:36,100 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:47:36,100 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:47:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-01-01 20:47:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-01 20:47:36,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:36,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-01 20:47:36,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 31073, now seen corresponding path program 1 times [2019-01-01 20:47:36,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:36,296 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-01 20:47:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:36,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:36,320 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-01-01 20:47:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:36,393 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-01 20:47:36,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-01 20:47:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:36,406 INFO L225 Difference]: With dead ends: 43 [2019-01-01 20:47:36,406 INFO L226 Difference]: Without dead ends: 30 [2019-01-01 20:47:36,409 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-01 20:47:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-01 20:47:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-01 20:47:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 20:47:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-01 20:47:36,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 3 [2019-01-01 20:47:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:36,444 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-01-01 20:47:36,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-01-01 20:47:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-01 20:47:36,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:36,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-01 20:47:36,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash 963307, now seen corresponding path program 1 times [2019-01-01 20:47:36,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:36,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:36,490 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-01 20:47:36,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:36,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:36,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:36,494 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-01-01 20:47:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:36,522 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-01 20:47:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:36,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-01 20:47:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:36,524 INFO L225 Difference]: With dead ends: 29 [2019-01-01 20:47:36,524 INFO L226 Difference]: Without dead ends: 28 [2019-01-01 20:47:36,526 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-01 20:47:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-01 20:47:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-01 20:47:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 20:47:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-01 20:47:36,531 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 4 [2019-01-01 20:47:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:36,531 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-01 20:47:36,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-01 20:47:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:47:36,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:36,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:36,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:36,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:36,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1366845466, now seen corresponding path program 1 times [2019-01-01 20:47:36,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:36,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:36,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:36,609 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-01 20:47:36,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:36,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:36,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:36,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:36,610 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-01-01 20:47:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:36,681 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-01 20:47:36,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:36,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 20:47:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:36,685 INFO L225 Difference]: With dead ends: 51 [2019-01-01 20:47:36,685 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 20:47:36,685 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-01 20:47:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 20:47:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-01-01 20:47:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-01 20:47:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2019-01-01 20:47:36,693 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 7 [2019-01-01 20:47:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:36,694 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2019-01-01 20:47:36,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2019-01-01 20:47:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:47:36,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:36,695 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-01 20:47:36,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1366808307, now seen corresponding path program 1 times [2019-01-01 20:47:36,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:36,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:36,770 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-01 20:47:36,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:36,770 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-01 20:47:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:36,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:36,898 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-01 20:47:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-01-01 20:47:36,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:47:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:47:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:36,920 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand 6 states. [2019-01-01 20:47:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:37,257 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-01-01 20:47:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:37,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-01 20:47:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:37,261 INFO L225 Difference]: With dead ends: 104 [2019-01-01 20:47:37,261 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 20:47:37,262 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-01 20:47:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 20:47:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 40. [2019-01-01 20:47:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 20:47:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2019-01-01 20:47:37,271 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 7 [2019-01-01 20:47:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:37,272 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-01-01 20:47:37,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:47:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2019-01-01 20:47:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 20:47:37,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:37,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:37,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:37,275 INFO L82 PathProgramCache]: Analyzing trace with hash 577463568, now seen corresponding path program 1 times [2019-01-01 20:47:37,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:37,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:37,317 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-01 20:47:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:37,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:37,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:37,319 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand 3 states. [2019-01-01 20:47:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:37,369 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2019-01-01 20:47:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:37,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 20:47:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:37,371 INFO L225 Difference]: With dead ends: 77 [2019-01-01 20:47:37,372 INFO L226 Difference]: Without dead ends: 75 [2019-01-01 20:47:37,372 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-01 20:47:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-01 20:47:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-01-01 20:47:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-01 20:47:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 106 transitions. [2019-01-01 20:47:37,386 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 106 transitions. Word has length 8 [2019-01-01 20:47:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:37,386 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 106 transitions. [2019-01-01 20:47:37,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 106 transitions. [2019-01-01 20:47:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:47:37,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:37,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:37,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 721693167, now seen corresponding path program 1 times [2019-01-01 20:47:37,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:37,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:37,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:37,467 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-01 20:47:37,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:37,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:37,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:37,468 INFO L87 Difference]: Start difference. First operand 71 states and 106 transitions. Second operand 3 states. [2019-01-01 20:47:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:37,570 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2019-01-01 20:47:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:37,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 20:47:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:37,574 INFO L225 Difference]: With dead ends: 139 [2019-01-01 20:47:37,574 INFO L226 Difference]: Without dead ends: 137 [2019-01-01 20:47:37,575 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-01 20:47:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-01 20:47:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2019-01-01 20:47:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 20:47:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2019-01-01 20:47:37,592 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 9 [2019-01-01 20:47:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:37,592 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2019-01-01 20:47:37,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2019-01-01 20:47:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 20:47:37,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:37,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:37,594 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:37,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:37,595 INFO L82 PathProgramCache]: Analyzing trace with hash 897651769, now seen corresponding path program 1 times [2019-01-01 20:47:37,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:37,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:37,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:37,624 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-01 20:47:37,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:47:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 20:47:37,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:47:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:47:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:47:37,626 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand 3 states. [2019-01-01 20:47:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:37,688 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2019-01-01 20:47:37,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:47:37,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 20:47:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:37,691 INFO L225 Difference]: With dead ends: 255 [2019-01-01 20:47:37,691 INFO L226 Difference]: Without dead ends: 253 [2019-01-01 20:47:37,692 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-01 20:47:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-01 20:47:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-01-01 20:47:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-01 20:47:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 377 transitions. [2019-01-01 20:47:37,738 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 377 transitions. Word has length 10 [2019-01-01 20:47:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:37,739 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 377 transitions. [2019-01-01 20:47:37,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:47:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 377 transitions. [2019-01-01 20:47:37,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:47:37,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:37,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 20:47:37,741 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash -795491305, now seen corresponding path program 1 times [2019-01-01 20:47:37,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:37,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:37,839 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-01 20:47:37,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:37,839 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-01 20:47:37,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:37,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:37,880 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-01 20:47:37,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:37,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 20:47:37,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:37,913 INFO L87 Difference]: Start difference. First operand 249 states and 377 transitions. Second operand 4 states. [2019-01-01 20:47:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:38,053 INFO L93 Difference]: Finished difference Result 449 states and 688 transitions. [2019-01-01 20:47:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:38,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-01 20:47:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:38,060 INFO L225 Difference]: With dead ends: 449 [2019-01-01 20:47:38,060 INFO L226 Difference]: Without dead ends: 447 [2019-01-01 20:47:38,061 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-01 20:47:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-01-01 20:47:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 357. [2019-01-01 20:47:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-01 20:47:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 543 transitions. [2019-01-01 20:47:38,088 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 543 transitions. Word has length 14 [2019-01-01 20:47:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:38,089 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 543 transitions. [2019-01-01 20:47:38,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 543 transitions. [2019-01-01 20:47:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:47:38,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:38,091 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:38,092 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 592160614, now seen corresponding path program 1 times [2019-01-01 20:47:38,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:38,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:38,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:38,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:38,152 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-01 20:47:38,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:38,152 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-01 20:47:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:38,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:38,250 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-01 20:47:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:47:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-01 20:47:38,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:38,271 INFO L87 Difference]: Start difference. First operand 357 states and 543 transitions. Second operand 5 states. [2019-01-01 20:47:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:38,430 INFO L93 Difference]: Finished difference Result 610 states and 939 transitions. [2019-01-01 20:47:38,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:38,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:47:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:38,438 INFO L225 Difference]: With dead ends: 610 [2019-01-01 20:47:38,438 INFO L226 Difference]: Without dead ends: 608 [2019-01-01 20:47:38,439 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-01 20:47:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-01-01 20:47:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 464. [2019-01-01 20:47:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-01-01 20:47:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 701 transitions. [2019-01-01 20:47:38,474 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 701 transitions. Word has length 16 [2019-01-01 20:47:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:38,475 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 701 transitions. [2019-01-01 20:47:38,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 701 transitions. [2019-01-01 20:47:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-01 20:47:38,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:38,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-01 20:47:38,480 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1222343671, now seen corresponding path program 1 times [2019-01-01 20:47:38,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:38,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:38,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:38,552 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-01 20:47:38,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:38,552 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-01 20:47:38,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:38,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:38,579 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-01 20:47:38,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:38,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-01 20:47:38,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:47:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:47:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:47:38,610 INFO L87 Difference]: Start difference. First operand 464 states and 701 transitions. Second operand 4 states. [2019-01-01 20:47:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:38,911 INFO L93 Difference]: Finished difference Result 834 states and 1284 transitions. [2019-01-01 20:47:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:47:38,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-01 20:47:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:38,921 INFO L225 Difference]: With dead ends: 834 [2019-01-01 20:47:38,922 INFO L226 Difference]: Without dead ends: 832 [2019-01-01 20:47:38,923 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-01 20:47:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-01-01 20:47:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 668. [2019-01-01 20:47:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-01-01 20:47:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1007 transitions. [2019-01-01 20:47:38,964 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1007 transitions. Word has length 18 [2019-01-01 20:47:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:38,964 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 1007 transitions. [2019-01-01 20:47:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:47:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1007 transitions. [2019-01-01 20:47:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:47:38,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:38,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:47:38,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:38,972 INFO L82 PathProgramCache]: Analyzing trace with hash -668230362, now seen corresponding path program 1 times [2019-01-01 20:47:38,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:38,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:38,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:39,039 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-01 20:47:39,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:39,040 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-01 20:47:39,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:39,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:39,150 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-01 20:47:39,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:47:39,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-01 20:47:39,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:39,172 INFO L87 Difference]: Start difference. First operand 668 states and 1007 transitions. Second operand 5 states. [2019-01-01 20:47:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:39,364 INFO L93 Difference]: Finished difference Result 1139 states and 1747 transitions. [2019-01-01 20:47:39,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:39,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 20:47:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:39,371 INFO L225 Difference]: With dead ends: 1139 [2019-01-01 20:47:39,371 INFO L226 Difference]: Without dead ends: 1137 [2019-01-01 20:47:39,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-01-01 20:47:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 871. [2019-01-01 20:47:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-01-01 20:47:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1297 transitions. [2019-01-01 20:47:39,417 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1297 transitions. Word has length 20 [2019-01-01 20:47:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:39,418 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1297 transitions. [2019-01-01 20:47:39,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1297 transitions. [2019-01-01 20:47:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:47:39,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:39,420 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-01 20:47:39,421 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2023206598, now seen corresponding path program 2 times [2019-01-01 20:47:39,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:39,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:39,695 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-01 20:47:39,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:39,696 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-01 20:47:39,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:47:39,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:47:39,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:39,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:39,771 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-01 20:47:39,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:39,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:47:39,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:39,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:39,812 INFO L87 Difference]: Start difference. First operand 871 states and 1297 transitions. Second operand 5 states. [2019-01-01 20:47:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:40,263 INFO L93 Difference]: Finished difference Result 1504 states and 2266 transitions. [2019-01-01 20:47:40,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:40,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:47:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:40,272 INFO L225 Difference]: With dead ends: 1504 [2019-01-01 20:47:40,272 INFO L226 Difference]: Without dead ends: 1502 [2019-01-01 20:47:40,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-01-01 20:47:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1193. [2019-01-01 20:47:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-01-01 20:47:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1768 transitions. [2019-01-01 20:47:40,333 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1768 transitions. Word has length 21 [2019-01-01 20:47:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:40,334 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1768 transitions. [2019-01-01 20:47:40,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1768 transitions. [2019-01-01 20:47:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:47:40,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:40,335 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-01 20:47:40,336 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1092753757, now seen corresponding path program 1 times [2019-01-01 20:47:40,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:40,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:40,434 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-01 20:47:40,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:40,435 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-01 20:47:40,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:40,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:40,472 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-01 20:47:40,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:40,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:47:40,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:40,503 INFO L87 Difference]: Start difference. First operand 1193 states and 1768 transitions. Second operand 5 states. [2019-01-01 20:47:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:40,903 INFO L93 Difference]: Finished difference Result 1951 states and 2902 transitions. [2019-01-01 20:47:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:40,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-01 20:47:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:40,915 INFO L225 Difference]: With dead ends: 1951 [2019-01-01 20:47:40,915 INFO L226 Difference]: Without dead ends: 1950 [2019-01-01 20:47:40,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-01 20:47:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-01-01 20:47:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1429. [2019-01-01 20:47:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-01-01 20:47:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2114 transitions. [2019-01-01 20:47:40,990 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2114 transitions. Word has length 25 [2019-01-01 20:47:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:40,990 INFO L480 AbstractCegarLoop]: Abstraction has 1429 states and 2114 transitions. [2019-01-01 20:47:40,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2114 transitions. [2019-01-01 20:47:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:47:40,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:40,994 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2019-01-01 20:47:40,994 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:40,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1883170607, now seen corresponding path program 2 times [2019-01-01 20:47:40,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:41,231 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-01 20:47:41,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:41,231 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-01 20:47:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:47:41,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:47:41,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:41,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:41,297 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-01 20:47:41,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:41,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:47:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:41,331 INFO L87 Difference]: Start difference. First operand 1429 states and 2114 transitions. Second operand 5 states. [2019-01-01 20:47:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:41,767 INFO L93 Difference]: Finished difference Result 2462 states and 3693 transitions. [2019-01-01 20:47:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:41,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-01 20:47:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:41,781 INFO L225 Difference]: With dead ends: 2462 [2019-01-01 20:47:41,782 INFO L226 Difference]: Without dead ends: 2460 [2019-01-01 20:47:41,784 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-01 20:47:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-01-01 20:47:41,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1959. [2019-01-01 20:47:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-01-01 20:47:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2882 transitions. [2019-01-01 20:47:41,865 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2882 transitions. Word has length 27 [2019-01-01 20:47:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:41,865 INFO L480 AbstractCegarLoop]: Abstraction has 1959 states and 2882 transitions. [2019-01-01 20:47:41,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2882 transitions. [2019-01-01 20:47:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 20:47:41,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:41,867 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-01 20:47:41,867 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:41,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash -748146377, now seen corresponding path program 3 times [2019-01-01 20:47:41,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:41,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:41,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:42,133 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-01 20:47:42,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:42,134 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-01 20:47:42,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:47:42,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:47:42,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:42,190 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-01 20:47:42,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:42,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:47:42,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:47:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:47:42,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:42,211 INFO L87 Difference]: Start difference. First operand 1959 states and 2882 transitions. Second operand 6 states. [2019-01-01 20:47:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:42,802 INFO L93 Difference]: Finished difference Result 3173 states and 4732 transitions. [2019-01-01 20:47:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:42,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-01 20:47:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:42,818 INFO L225 Difference]: With dead ends: 3173 [2019-01-01 20:47:42,818 INFO L226 Difference]: Without dead ends: 3171 [2019-01-01 20:47:42,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-01 20:47:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2019-01-01 20:47:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 2563. [2019-01-01 20:47:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-01-01 20:47:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3749 transitions. [2019-01-01 20:47:42,920 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3749 transitions. Word has length 28 [2019-01-01 20:47:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:42,920 INFO L480 AbstractCegarLoop]: Abstraction has 2563 states and 3749 transitions. [2019-01-01 20:47:42,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:47:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3749 transitions. [2019-01-01 20:47:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 20:47:42,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:42,922 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-01 20:47:42,923 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:42,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:42,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1682870728, now seen corresponding path program 1 times [2019-01-01 20:47:42,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:42,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:42,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:43,080 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-01 20:47:43,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:43,080 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-01 20:47:43,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:43,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:43,120 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-01 20:47:43,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:43,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-01 20:47:43,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:47:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:47:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:47:43,147 INFO L87 Difference]: Start difference. First operand 2563 states and 3749 transitions. Second operand 5 states. [2019-01-01 20:47:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:43,612 INFO L93 Difference]: Finished difference Result 4182 states and 6155 transitions. [2019-01-01 20:47:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:47:43,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-01 20:47:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:43,634 INFO L225 Difference]: With dead ends: 4182 [2019-01-01 20:47:43,635 INFO L226 Difference]: Without dead ends: 4181 [2019-01-01 20:47:43,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-01 20:47:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-01-01 20:47:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 3071. [2019-01-01 20:47:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-01-01 20:47:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4483 transitions. [2019-01-01 20:47:43,762 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4483 transitions. Word has length 31 [2019-01-01 20:47:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:43,763 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 4483 transitions. [2019-01-01 20:47:43,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:47:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4483 transitions. [2019-01-01 20:47:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 20:47:43,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:43,765 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-01 20:47:43,765 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1047523897, now seen corresponding path program 2 times [2019-01-01 20:47:43,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:43,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:43,906 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-01 20:47:43,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:43,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 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-01 20:47:43,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:47:43,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:47:43,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:43,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:43,941 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-01 20:47:43,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:43,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:47:43,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:47:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:47:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:43,964 INFO L87 Difference]: Start difference. First operand 3071 states and 4483 transitions. Second operand 6 states. [2019-01-01 20:47:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:44,265 INFO L93 Difference]: Finished difference Result 4727 states and 6947 transitions. [2019-01-01 20:47:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:44,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-01-01 20:47:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:44,290 INFO L225 Difference]: With dead ends: 4727 [2019-01-01 20:47:44,290 INFO L226 Difference]: Without dead ends: 4726 [2019-01-01 20:47:44,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-01 20:47:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-01-01 20:47:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 3459. [2019-01-01 20:47:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2019-01-01 20:47:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5047 transitions. [2019-01-01 20:47:44,438 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5047 transitions. Word has length 33 [2019-01-01 20:47:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:44,439 INFO L480 AbstractCegarLoop]: Abstraction has 3459 states and 5047 transitions. [2019-01-01 20:47:44,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:47:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5047 transitions. [2019-01-01 20:47:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 20:47:44,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:44,441 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-01 20:47:44,441 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash -507101786, now seen corresponding path program 4 times [2019-01-01 20:47:44,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:44,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:44,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:44,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:44,965 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-01 20:47:44,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:44,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:47:44,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:47:45,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:47:45,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:45,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:45,032 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-01 20:47:45,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:45,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:47:45,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:47:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:47:45,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:45,055 INFO L87 Difference]: Start difference. First operand 3459 states and 5047 transitions. Second operand 7 states. [2019-01-01 20:47:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:45,353 INFO L93 Difference]: Finished difference Result 5326 states and 7884 transitions. [2019-01-01 20:47:45,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:47:45,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-01-01 20:47:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:45,380 INFO L225 Difference]: With dead ends: 5326 [2019-01-01 20:47:45,380 INFO L226 Difference]: Without dead ends: 5324 [2019-01-01 20:47:45,384 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-01 20:47:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2019-01-01 20:47:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 4377. [2019-01-01 20:47:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4377 states. [2019-01-01 20:47:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4377 states to 4377 states and 6353 transitions. [2019-01-01 20:47:45,593 INFO L78 Accepts]: Start accepts. Automaton has 4377 states and 6353 transitions. Word has length 35 [2019-01-01 20:47:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:45,593 INFO L480 AbstractCegarLoop]: Abstraction has 4377 states and 6353 transitions. [2019-01-01 20:47:45,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:47:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4377 states and 6353 transitions. [2019-01-01 20:47:45,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 20:47:45,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:45,597 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1] [2019-01-01 20:47:45,598 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:45,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:45,600 INFO L82 PathProgramCache]: Analyzing trace with hash -32854327, now seen corresponding path program 3 times [2019-01-01 20:47:45,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:45,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:45,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:45,777 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-01 20:47:45,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:45,778 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-01 20:47:45,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:47:45,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:47:45,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:45,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:45,847 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-01 20:47:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:47:45,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:47:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:47:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:45,879 INFO L87 Difference]: Start difference. First operand 4377 states and 6353 transitions. Second operand 6 states. [2019-01-01 20:47:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:46,252 INFO L93 Difference]: Finished difference Result 7069 states and 10425 transitions. [2019-01-01 20:47:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:46,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-01 20:47:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:46,270 INFO L225 Difference]: With dead ends: 7069 [2019-01-01 20:47:46,271 INFO L226 Difference]: Without dead ends: 7067 [2019-01-01 20:47:46,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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-01 20:47:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2019-01-01 20:47:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 5729. [2019-01-01 20:47:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-01-01 20:47:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 8265 transitions. [2019-01-01 20:47:46,461 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 8265 transitions. Word has length 36 [2019-01-01 20:47:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:46,461 INFO L480 AbstractCegarLoop]: Abstraction has 5729 states and 8265 transitions. [2019-01-01 20:47:46,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:47:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 8265 transitions. [2019-01-01 20:47:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 20:47:46,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:46,463 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1] [2019-01-01 20:47:46,464 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1137071253, now seen corresponding path program 2 times [2019-01-01 20:47:46,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:46,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:46,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:46,545 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-01 20:47:46,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:46,546 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-01 20:47:46,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:47:46,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:47:46,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:46,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:46,581 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-01 20:47:46,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:46,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 20:47:46,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:47:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:47:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:46,603 INFO L87 Difference]: Start difference. First operand 5729 states and 8265 transitions. Second operand 6 states. [2019-01-01 20:47:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:46,860 INFO L93 Difference]: Finished difference Result 8806 states and 12809 transitions. [2019-01-01 20:47:46,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:47:46,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-01 20:47:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:46,880 INFO L225 Difference]: With dead ends: 8806 [2019-01-01 20:47:46,881 INFO L226 Difference]: Without dead ends: 8805 [2019-01-01 20:47:46,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:47:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8805 states. [2019-01-01 20:47:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8805 to 6453. [2019-01-01 20:47:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-01-01 20:47:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 9305 transitions. [2019-01-01 20:47:47,117 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 9305 transitions. Word has length 41 [2019-01-01 20:47:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:47,117 INFO L480 AbstractCegarLoop]: Abstraction has 6453 states and 9305 transitions. [2019-01-01 20:47:47,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:47:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 9305 transitions. [2019-01-01 20:47:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 20:47:47,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:47,122 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-01 20:47:47,122 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash 589297713, now seen corresponding path program 3 times [2019-01-01 20:47:47,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:47,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:47,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:47,254 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-01 20:47:47,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:47,255 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-01 20:47:47,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:47:47,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 20:47:47,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:47,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:47,359 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-01 20:47:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:47:47,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:47:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:47:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:47,395 INFO L87 Difference]: Start difference. First operand 6453 states and 9305 transitions. Second operand 7 states. [2019-01-01 20:47:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:47,765 INFO L93 Difference]: Finished difference Result 9500 states and 13815 transitions. [2019-01-01 20:47:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:47:47,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 20:47:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:47,788 INFO L225 Difference]: With dead ends: 9500 [2019-01-01 20:47:47,788 INFO L226 Difference]: Without dead ends: 9499 [2019-01-01 20:47:47,797 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-01 20:47:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9499 states. [2019-01-01 20:47:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9499 to 7025. [2019-01-01 20:47:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7025 states. [2019-01-01 20:47:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7025 states to 7025 states and 10131 transitions. [2019-01-01 20:47:48,134 INFO L78 Accepts]: Start accepts. Automaton has 7025 states and 10131 transitions. Word has length 41 [2019-01-01 20:47:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:48,134 INFO L480 AbstractCegarLoop]: Abstraction has 7025 states and 10131 transitions. [2019-01-01 20:47:48,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:47:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7025 states and 10131 transitions. [2019-01-01 20:47:48,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 20:47:48,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:48,136 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-01 20:47:48,137 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:48,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:48,137 INFO L82 PathProgramCache]: Analyzing trace with hash 644163159, now seen corresponding path program 5 times [2019-01-01 20:47:48,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:48,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:48,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:48,265 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-01 20:47:48,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:48,266 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-01 20:47:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:47:48,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:47:48,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:48,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:48,306 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-01 20:47:48,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:48,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:47:48,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:48,327 INFO L87 Difference]: Start difference. First operand 7025 states and 10131 transitions. Second operand 8 states. [2019-01-01 20:47:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:48,566 INFO L93 Difference]: Finished difference Result 10381 states and 15206 transitions. [2019-01-01 20:47:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:47:48,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-01-01 20:47:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:48,588 INFO L225 Difference]: With dead ends: 10381 [2019-01-01 20:47:48,588 INFO L226 Difference]: Without dead ends: 10379 [2019-01-01 20:47:48,597 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-01 20:47:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-01-01 20:47:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 8665. [2019-01-01 20:47:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2019-01-01 20:47:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 12438 transitions. [2019-01-01 20:47:48,899 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 12438 transitions. Word has length 42 [2019-01-01 20:47:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:48,899 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 12438 transitions. [2019-01-01 20:47:48,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 12438 transitions. [2019-01-01 20:47:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 20:47:48,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:48,904 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1] [2019-01-01 20:47:48,904 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash -809708433, now seen corresponding path program 4 times [2019-01-01 20:47:48,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:48,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:48,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:48,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:48,999 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-01 20:47:49,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:49,000 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-01 20:47:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:47:49,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:47:49,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:49,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:49,041 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-01 20:47:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:47:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:47:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:47:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:49,060 INFO L87 Difference]: Start difference. First operand 8665 states and 12438 transitions. Second operand 7 states. [2019-01-01 20:47:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:49,329 INFO L93 Difference]: Finished difference Result 13312 states and 19429 transitions. [2019-01-01 20:47:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:47:49,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-01-01 20:47:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:49,349 INFO L225 Difference]: With dead ends: 13312 [2019-01-01 20:47:49,349 INFO L226 Difference]: Without dead ends: 13310 [2019-01-01 20:47:49,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-01-01 20:47:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10967. [2019-01-01 20:47:49,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10967 states. [2019-01-01 20:47:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10967 states to 10967 states and 15657 transitions. [2019-01-01 20:47:49,840 INFO L78 Accepts]: Start accepts. Automaton has 10967 states and 15657 transitions. Word has length 45 [2019-01-01 20:47:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:49,840 INFO L480 AbstractCegarLoop]: Abstraction has 10967 states and 15657 transitions. [2019-01-01 20:47:49,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:47:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10967 states and 15657 transitions. [2019-01-01 20:47:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 20:47:49,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:49,846 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-01 20:47:49,846 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash -144620410, now seen corresponding path program 6 times [2019-01-01 20:47:49,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:49,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:49,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:49,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:49,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:50,121 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-01 20:47:50,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:50,121 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-01 20:47:50,132 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:47:50,150 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:47:50,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:50,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:50,160 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-01 20:47:50,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:50,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:47:50,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:47:50,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:47:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:50,182 INFO L87 Difference]: Start difference. First operand 10967 states and 15657 transitions. Second operand 9 states. [2019-01-01 20:47:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:50,469 INFO L93 Difference]: Finished difference Result 15622 states and 22665 transitions. [2019-01-01 20:47:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:47:50,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-01-01 20:47:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:50,487 INFO L225 Difference]: With dead ends: 15622 [2019-01-01 20:47:50,487 INFO L226 Difference]: Without dead ends: 15620 [2019-01-01 20:47:50,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-01-01 20:47:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 13091. [2019-01-01 20:47:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13091 states. [2019-01-01 20:47:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13091 states to 13091 states and 18609 transitions. [2019-01-01 20:47:50,903 INFO L78 Accepts]: Start accepts. Automaton has 13091 states and 18609 transitions. Word has length 49 [2019-01-01 20:47:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:50,903 INFO L480 AbstractCegarLoop]: Abstraction has 13091 states and 18609 transitions. [2019-01-01 20:47:50,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:47:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13091 states and 18609 transitions. [2019-01-01 20:47:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-01 20:47:50,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:50,908 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-01 20:47:50,909 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2004605083, now seen corresponding path program 4 times [2019-01-01 20:47:50,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:50,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:51,256 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-01 20:47:51,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:51,257 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-01 20:47:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:47:51,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:47:51,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:51,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:51,304 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-01 20:47:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:51,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:47:51,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:51,327 INFO L87 Difference]: Start difference. First operand 13091 states and 18609 transitions. Second operand 8 states. [2019-01-01 20:47:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:51,749 INFO L93 Difference]: Finished difference Result 19890 states and 28521 transitions. [2019-01-01 20:47:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:47:51,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-01-01 20:47:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:51,774 INFO L225 Difference]: With dead ends: 19890 [2019-01-01 20:47:51,774 INFO L226 Difference]: Without dead ends: 19889 [2019-01-01 20:47:51,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19889 states. [2019-01-01 20:47:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19889 to 14129. [2019-01-01 20:47:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2019-01-01 20:47:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 20097 transitions. [2019-01-01 20:47:52,295 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 20097 transitions. Word has length 49 [2019-01-01 20:47:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:52,295 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 20097 transitions. [2019-01-01 20:47:52,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 20097 transitions. [2019-01-01 20:47:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 20:47:52,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:52,298 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2019-01-01 20:47:52,299 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -85375778, now seen corresponding path program 3 times [2019-01-01 20:47:52,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:52,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:52,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:52,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:52,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:52,416 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-01 20:47:52,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:52,416 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-01 20:47:52,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:47:52,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 20:47:52,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:52,474 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-01 20:47:52,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:52,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 20:47:52,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:47:52,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:47:52,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:47:52,497 INFO L87 Difference]: Start difference. First operand 14129 states and 20097 transitions. Second operand 7 states. [2019-01-01 20:47:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:53,081 INFO L93 Difference]: Finished difference Result 20774 states and 29837 transitions. [2019-01-01 20:47:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:47:53,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-01 20:47:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:53,108 INFO L225 Difference]: With dead ends: 20774 [2019-01-01 20:47:53,108 INFO L226 Difference]: Without dead ends: 20773 [2019-01-01 20:47:53,117 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-01 20:47:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20773 states. [2019-01-01 20:47:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20773 to 15381. [2019-01-01 20:47:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15381 states. [2019-01-01 20:47:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15381 states to 15381 states and 21881 transitions. [2019-01-01 20:47:53,550 INFO L78 Accepts]: Start accepts. Automaton has 15381 states and 21881 transitions. Word has length 51 [2019-01-01 20:47:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:53,550 INFO L480 AbstractCegarLoop]: Abstraction has 15381 states and 21881 transitions. [2019-01-01 20:47:53,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:47:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15381 states and 21881 transitions. [2019-01-01 20:47:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-01 20:47:53,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:53,553 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1] [2019-01-01 20:47:53,554 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -884758135, now seen corresponding path program 5 times [2019-01-01 20:47:53,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:53,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:53,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:53,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:53,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:53,719 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-01 20:47:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:53,720 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-01 20:47:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:47:53,743 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-01 20:47:53,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:53,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:53,751 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-01 20:47:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:47:53,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:53,771 INFO L87 Difference]: Start difference. First operand 15381 states and 21881 transitions. Second operand 8 states. [2019-01-01 20:47:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:54,362 INFO L93 Difference]: Finished difference Result 22697 states and 32841 transitions. [2019-01-01 20:47:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:47:54,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-01 20:47:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:54,386 INFO L225 Difference]: With dead ends: 22697 [2019-01-01 20:47:54,386 INFO L226 Difference]: Without dead ends: 22695 [2019-01-01 20:47:54,393 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-01 20:47:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22695 states. [2019-01-01 20:47:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22695 to 18973. [2019-01-01 20:47:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18973 states. [2019-01-01 20:47:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 26864 transitions. [2019-01-01 20:47:54,889 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 26864 transitions. Word has length 54 [2019-01-01 20:47:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:54,889 INFO L480 AbstractCegarLoop]: Abstraction has 18973 states and 26864 transitions. [2019-01-01 20:47:54,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:47:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 26864 transitions. [2019-01-01 20:47:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 20:47:54,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:54,893 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-01 20:47:54,893 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash -931224713, now seen corresponding path program 7 times [2019-01-01 20:47:54,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:54,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:54,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:54,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:54,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:55,020 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-01 20:47:55,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:55,021 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-01 20:47:55,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:55,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:55,073 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-01 20:47:55,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:55,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:47:55,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:47:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:47:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:47:55,106 INFO L87 Difference]: Start difference. First operand 18973 states and 26864 transitions. Second operand 10 states. [2019-01-01 20:47:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:55,783 INFO L93 Difference]: Finished difference Result 26251 states and 37778 transitions. [2019-01-01 20:47:55,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:47:55,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-01 20:47:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:55,817 INFO L225 Difference]: With dead ends: 26251 [2019-01-01 20:47:55,817 INFO L226 Difference]: Without dead ends: 26249 [2019-01-01 20:47:55,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:47:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26249 states. [2019-01-01 20:47:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26249 to 22311. [2019-01-01 20:47:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22311 states. [2019-01-01 20:47:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22311 states to 22311 states and 31473 transitions. [2019-01-01 20:47:56,737 INFO L78 Accepts]: Start accepts. Automaton has 22311 states and 31473 transitions. Word has length 56 [2019-01-01 20:47:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:56,737 INFO L480 AbstractCegarLoop]: Abstraction has 22311 states and 31473 transitions. [2019-01-01 20:47:56,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:47:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 22311 states and 31473 transitions. [2019-01-01 20:47:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 20:47:56,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:56,741 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-01 20:47:56,742 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:56,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2041729275, now seen corresponding path program 5 times [2019-01-01 20:47:56,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:56,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:56,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:56,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:47:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:57,137 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-01 20:47:57,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:57,137 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-01 20:47:57,149 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:47:57,172 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-01 20:47:57,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:57,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:57,182 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-01 20:47:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:57,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:47:57,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:47:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:47:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:57,201 INFO L87 Difference]: Start difference. First operand 22311 states and 31473 transitions. Second operand 9 states. [2019-01-01 20:47:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:57,973 INFO L93 Difference]: Finished difference Result 32955 states and 46932 transitions. [2019-01-01 20:47:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:47:57,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-01 20:47:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:58,012 INFO L225 Difference]: With dead ends: 32955 [2019-01-01 20:47:58,013 INFO L226 Difference]: Without dead ends: 32954 [2019-01-01 20:47:58,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:47:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32954 states. [2019-01-01 20:47:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32954 to 23705. [2019-01-01 20:47:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23705 states. [2019-01-01 20:47:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23705 states to 23705 states and 33462 transitions. [2019-01-01 20:47:58,670 INFO L78 Accepts]: Start accepts. Automaton has 23705 states and 33462 transitions. Word has length 57 [2019-01-01 20:47:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:47:58,670 INFO L480 AbstractCegarLoop]: Abstraction has 23705 states and 33462 transitions. [2019-01-01 20:47:58,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:47:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 23705 states and 33462 transitions. [2019-01-01 20:47:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-01 20:47:58,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:47:58,674 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1] [2019-01-01 20:47:58,675 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:47:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:47:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2087316113, now seen corresponding path program 4 times [2019-01-01 20:47:58,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:47:58,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:47:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:58,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:47:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:47:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:47:58,785 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-01 20:47:58,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:47:58,786 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-01 20:47:58,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:47:58,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:47:58,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:47:58,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:47:58,827 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-01 20:47:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:47:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:47:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:47:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:47:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:47:58,852 INFO L87 Difference]: Start difference. First operand 23705 states and 33462 transitions. Second operand 8 states. [2019-01-01 20:47:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:47:59,770 INFO L93 Difference]: Finished difference Result 33669 states and 48018 transitions. [2019-01-01 20:47:59,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:47:59,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2019-01-01 20:47:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:47:59,809 INFO L225 Difference]: With dead ends: 33669 [2019-01-01 20:47:59,809 INFO L226 Difference]: Without dead ends: 33668 [2019-01-01 20:47:59,819 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-01 20:47:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-01-01 20:48:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 25269. [2019-01-01 20:48:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25269 states. [2019-01-01 20:48:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25269 states to 25269 states and 35684 transitions. [2019-01-01 20:48:00,437 INFO L78 Accepts]: Start accepts. Automaton has 25269 states and 35684 transitions. Word has length 61 [2019-01-01 20:48:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:00,438 INFO L480 AbstractCegarLoop]: Abstraction has 25269 states and 35684 transitions. [2019-01-01 20:48:00,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:48:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 25269 states and 35684 transitions. [2019-01-01 20:48:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 20:48:00,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:00,442 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-01 20:48:00,442 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1714864998, now seen corresponding path program 8 times [2019-01-01 20:48:00,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:00,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:00,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:00,631 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-01 20:48:00,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:00,632 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-01 20:48:00,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:00,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:00,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:00,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:00,672 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-01 20:48:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:48:00,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:48:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:48:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:00,702 INFO L87 Difference]: Start difference. First operand 25269 states and 35684 transitions. Second operand 11 states. [2019-01-01 20:48:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:01,496 INFO L93 Difference]: Finished difference Result 34130 states and 48968 transitions. [2019-01-01 20:48:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:48:01,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-01-01 20:48:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:01,536 INFO L225 Difference]: With dead ends: 34130 [2019-01-01 20:48:01,536 INFO L226 Difference]: Without dead ends: 34128 [2019-01-01 20:48:01,547 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-01 20:48:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2019-01-01 20:48:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 29345. [2019-01-01 20:48:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29345 states. [2019-01-01 20:48:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29345 states to 29345 states and 41306 transitions. [2019-01-01 20:48:02,801 INFO L78 Accepts]: Start accepts. Automaton has 29345 states and 41306 transitions. Word has length 63 [2019-01-01 20:48:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:02,801 INFO L480 AbstractCegarLoop]: Abstraction has 29345 states and 41306 transitions. [2019-01-01 20:48:02,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:48:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29345 states and 41306 transitions. [2019-01-01 20:48:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 20:48:02,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:02,805 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1] [2019-01-01 20:48:02,806 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1360130479, now seen corresponding path program 6 times [2019-01-01 20:48:02,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:02,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:03,594 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-01 20:48:03,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:03,594 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-01 20:48:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:03,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-01 20:48:03,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:03,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:03,639 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-01 20:48:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:48:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:48:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:48:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:03,659 INFO L87 Difference]: Start difference. First operand 29345 states and 41306 transitions. Second operand 9 states. [2019-01-01 20:48:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:04,482 INFO L93 Difference]: Finished difference Result 41880 states and 59971 transitions. [2019-01-01 20:48:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:48:04,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-01-01 20:48:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:04,529 INFO L225 Difference]: With dead ends: 41880 [2019-01-01 20:48:04,530 INFO L226 Difference]: Without dead ends: 41878 [2019-01-01 20:48:04,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41878 states. [2019-01-01 20:48:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41878 to 35465. [2019-01-01 20:48:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2019-01-01 20:48:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 49718 transitions. [2019-01-01 20:48:05,428 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 49718 transitions. Word has length 63 [2019-01-01 20:48:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:05,428 INFO L480 AbstractCegarLoop]: Abstraction has 35465 states and 49718 transitions. [2019-01-01 20:48:05,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:48:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 49718 transitions. [2019-01-01 20:48:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-01 20:48:05,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:05,433 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-01 20:48:05,433 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash -851477649, now seen corresponding path program 6 times [2019-01-01 20:48:05,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:05,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:05,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:05,541 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-01 20:48:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:05,541 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-01 20:48:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:05,575 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-01 20:48:05,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:05,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:05,588 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-01 20:48:05,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:48:05,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:48:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:48:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:05,608 INFO L87 Difference]: Start difference. First operand 35465 states and 49718 transitions. Second operand 10 states. [2019-01-01 20:48:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:07,182 INFO L93 Difference]: Finished difference Result 51129 states and 72397 transitions. [2019-01-01 20:48:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:48:07,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-01 20:48:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:07,245 INFO L225 Difference]: With dead ends: 51129 [2019-01-01 20:48:07,245 INFO L226 Difference]: Without dead ends: 51128 [2019-01-01 20:48:07,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51128 states. [2019-01-01 20:48:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51128 to 37261. [2019-01-01 20:48:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2019-01-01 20:48:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 52271 transitions. [2019-01-01 20:48:08,354 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 52271 transitions. Word has length 65 [2019-01-01 20:48:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:08,355 INFO L480 AbstractCegarLoop]: Abstraction has 37261 states and 52271 transitions. [2019-01-01 20:48:08,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:48:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 52271 transitions. [2019-01-01 20:48:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 20:48:08,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:08,360 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-01 20:48:08,360 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1457084265, now seen corresponding path program 9 times [2019-01-01 20:48:08,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:08,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:08,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:08,511 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-01 20:48:08,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:08,512 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-01 20:48:08,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:08,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:48:08,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:08,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:08,559 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-01 20:48:08,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:08,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:48:08,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:08,578 INFO L87 Difference]: Start difference. First operand 37261 states and 52271 transitions. Second operand 12 states. [2019-01-01 20:48:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:09,607 INFO L93 Difference]: Finished difference Result 49299 states and 70254 transitions. [2019-01-01 20:48:09,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:09,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-01-01 20:48:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:09,669 INFO L225 Difference]: With dead ends: 49299 [2019-01-01 20:48:09,669 INFO L226 Difference]: Without dead ends: 49297 [2019-01-01 20:48:09,684 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-01 20:48:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49297 states. [2019-01-01 20:48:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49297 to 42813. [2019-01-01 20:48:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42813 states. [2019-01-01 20:48:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42813 states to 42813 states and 59889 transitions. [2019-01-01 20:48:11,408 INFO L78 Accepts]: Start accepts. Automaton has 42813 states and 59889 transitions. Word has length 70 [2019-01-01 20:48:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:11,408 INFO L480 AbstractCegarLoop]: Abstraction has 42813 states and 59889 transitions. [2019-01-01 20:48:11,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42813 states and 59889 transitions. [2019-01-01 20:48:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 20:48:11,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:11,414 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1] [2019-01-01 20:48:11,414 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1593226108, now seen corresponding path program 5 times [2019-01-01 20:48:11,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:11,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:11,518 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-01 20:48:11,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:11,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 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-01 20:48:11,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:48:11,551 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-01 20:48:11,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:11,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:11,565 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-01 20:48:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:11,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:48:11,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:48:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:48:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:48:11,588 INFO L87 Difference]: Start difference. First operand 42813 states and 59889 transitions. Second operand 9 states. [2019-01-01 20:48:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:12,719 INFO L93 Difference]: Finished difference Result 59102 states and 83563 transitions. [2019-01-01 20:48:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:48:12,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-01-01 20:48:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:12,788 INFO L225 Difference]: With dead ends: 59102 [2019-01-01 20:48:12,789 INFO L226 Difference]: Without dead ends: 59101 [2019-01-01 20:48:12,807 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-01 20:48:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59101 states. [2019-01-01 20:48:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59101 to 45005. [2019-01-01 20:48:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45005 states. [2019-01-01 20:48:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45005 states to 45005 states and 62987 transitions. [2019-01-01 20:48:13,980 INFO L78 Accepts]: Start accepts. Automaton has 45005 states and 62987 transitions. Word has length 71 [2019-01-01 20:48:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:13,980 INFO L480 AbstractCegarLoop]: Abstraction has 45005 states and 62987 transitions. [2019-01-01 20:48:13,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:48:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45005 states and 62987 transitions. [2019-01-01 20:48:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-01 20:48:13,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:13,987 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1] [2019-01-01 20:48:13,988 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1572566089, now seen corresponding path program 7 times [2019-01-01 20:48:13,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:14,283 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-01 20:48:14,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:14,283 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-01 20:48:14,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:14,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:14,320 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-01 20:48:14,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:48:14,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:48:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:48:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:14,340 INFO L87 Difference]: Start difference. First operand 45005 states and 62987 transitions. Second operand 10 states. [2019-01-01 20:48:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:15,723 INFO L93 Difference]: Finished difference Result 62465 states and 88920 transitions. [2019-01-01 20:48:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:48:15,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-01-01 20:48:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:15,801 INFO L225 Difference]: With dead ends: 62465 [2019-01-01 20:48:15,801 INFO L226 Difference]: Without dead ends: 62463 [2019-01-01 20:48:15,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62463 states. [2019-01-01 20:48:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62463 to 53489. [2019-01-01 20:48:17,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-01-01 20:48:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 74598 transitions. [2019-01-01 20:48:17,330 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 74598 transitions. Word has length 72 [2019-01-01 20:48:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:17,330 INFO L480 AbstractCegarLoop]: Abstraction has 53489 states and 74598 transitions. [2019-01-01 20:48:17,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:48:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 74598 transitions. [2019-01-01 20:48:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-01 20:48:17,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:17,337 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-01 20:48:17,338 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2147171801, now seen corresponding path program 7 times [2019-01-01 20:48:17,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:17,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:17,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:17,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:17,777 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-01 20:48:17,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:17,778 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-01 20:48:17,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:17,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:17,831 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-01 20:48:17,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:17,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:48:17,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:48:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:48:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:17,850 INFO L87 Difference]: Start difference. First operand 53489 states and 74598 transitions. Second operand 11 states. [2019-01-01 20:48:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:19,514 INFO L93 Difference]: Finished difference Result 75498 states and 106380 transitions. [2019-01-01 20:48:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:48:19,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-01-01 20:48:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:19,615 INFO L225 Difference]: With dead ends: 75498 [2019-01-01 20:48:19,616 INFO L226 Difference]: Without dead ends: 75497 [2019-01-01 20:48:19,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75497 states. [2019-01-01 20:48:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75497 to 55733. [2019-01-01 20:48:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55733 states. [2019-01-01 20:48:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55733 states to 55733 states and 77778 transitions. [2019-01-01 20:48:21,978 INFO L78 Accepts]: Start accepts. Automaton has 55733 states and 77778 transitions. Word has length 73 [2019-01-01 20:48:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:21,978 INFO L480 AbstractCegarLoop]: Abstraction has 55733 states and 77778 transitions. [2019-01-01 20:48:21,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:48:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55733 states and 77778 transitions. [2019-01-01 20:48:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-01 20:48:21,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:21,987 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1] [2019-01-01 20:48:21,987 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1519696454, now seen corresponding path program 10 times [2019-01-01 20:48:21,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:22,486 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-01 20:48:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:22,486 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-01 20:48:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:48:22,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:48:22,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:22,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:23,517 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-01 20:48:23,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:48:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 23 [2019-01-01 20:48:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 20:48:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 20:48:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:48:23,544 INFO L87 Difference]: Start difference. First operand 55733 states and 77778 transitions. Second operand 24 states. [2019-01-01 20:48:25,571 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 20:48:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:27,312 INFO L93 Difference]: Finished difference Result 74710 states and 103067 transitions. [2019-01-01 20:48:27,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-01 20:48:27,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2019-01-01 20:48:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:27,315 INFO L225 Difference]: With dead ends: 74710 [2019-01-01 20:48:27,315 INFO L226 Difference]: Without dead ends: 1364 [2019-01-01 20:48:27,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2234, Invalid=5776, Unknown=0, NotChecked=0, Total=8010 [2019-01-01 20:48:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-01-01 20:48:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 585. [2019-01-01 20:48:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-01-01 20:48:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 700 transitions. [2019-01-01 20:48:27,394 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 700 transitions. Word has length 77 [2019-01-01 20:48:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:27,396 INFO L480 AbstractCegarLoop]: Abstraction has 585 states and 700 transitions. [2019-01-01 20:48:27,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 20:48:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 700 transitions. [2019-01-01 20:48:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-01 20:48:27,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:27,401 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1] [2019-01-01 20:48:27,401 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1093517585, now seen corresponding path program 8 times [2019-01-01 20:48:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:27,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:27,886 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-01 20:48:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:27,886 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-01 20:48:27,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:27,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:27,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:27,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:27,953 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-01 20:48:27,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:27,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:48:27,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:48:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:48:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:27,973 INFO L87 Difference]: Start difference. First operand 585 states and 700 transitions. Second operand 11 states. [2019-01-01 20:48:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:28,063 INFO L93 Difference]: Finished difference Result 701 states and 822 transitions. [2019-01-01 20:48:28,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:48:28,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-01-01 20:48:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:28,065 INFO L225 Difference]: With dead ends: 701 [2019-01-01 20:48:28,065 INFO L226 Difference]: Without dead ends: 587 [2019-01-01 20:48:28,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-01 20:48:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 481. [2019-01-01 20:48:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-01-01 20:48:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 563 transitions. [2019-01-01 20:48:28,085 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 563 transitions. Word has length 81 [2019-01-01 20:48:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:28,085 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 563 transitions. [2019-01-01 20:48:28,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:48:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 563 transitions. [2019-01-01 20:48:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-01 20:48:28,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:28,086 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1] [2019-01-01 20:48:28,087 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash -944170313, now seen corresponding path program 6 times [2019-01-01 20:48:28,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:28,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:28,488 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-01 20:48:28,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:28,488 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-01 20:48:28,499 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 20:48:28,533 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-01 20:48:28,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:28,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:28,546 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-01 20:48:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:28,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:48:28,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:48:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:48:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:48:28,565 INFO L87 Difference]: Start difference. First operand 481 states and 563 transitions. Second operand 10 states. [2019-01-01 20:48:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:28,655 INFO L93 Difference]: Finished difference Result 546 states and 639 transitions. [2019-01-01 20:48:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:48:28,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-01-01 20:48:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:28,658 INFO L225 Difference]: With dead ends: 546 [2019-01-01 20:48:28,659 INFO L226 Difference]: Without dead ends: 379 [2019-01-01 20:48:28,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 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-01 20:48:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-01 20:48:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-01-01 20:48:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-01-01 20:48:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 417 transitions. [2019-01-01 20:48:28,676 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 417 transitions. Word has length 81 [2019-01-01 20:48:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 417 transitions. [2019-01-01 20:48:28,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:48:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 417 transitions. [2019-01-01 20:48:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-01 20:48:28,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:28,678 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-01 20:48:28,678 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2010450365, now seen corresponding path program 8 times [2019-01-01 20:48:28,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:28,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:28,905 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-01 20:48:28,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:28,905 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-01 20:48:28,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:28,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:28,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:28,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:28,953 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-01 20:48:28,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:28,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:48:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:28,972 INFO L87 Difference]: Start difference. First operand 379 states and 417 transitions. Second operand 12 states. [2019-01-01 20:48:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:29,033 INFO L93 Difference]: Finished difference Result 464 states and 501 transitions. [2019-01-01 20:48:29,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:29,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-01-01 20:48:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:29,035 INFO L225 Difference]: With dead ends: 464 [2019-01-01 20:48:29,035 INFO L226 Difference]: Without dead ends: 397 [2019-01-01 20:48:29,036 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-01 20:48:29,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-01 20:48:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 306. [2019-01-01 20:48:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-01 20:48:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2019-01-01 20:48:29,047 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 81 [2019-01-01 20:48:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:29,048 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2019-01-01 20:48:29,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2019-01-01 20:48:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-01 20:48:29,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:29,049 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1] [2019-01-01 20:48:29,049 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1856106743, now seen corresponding path program 9 times [2019-01-01 20:48:29,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:29,191 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-01 20:48:29,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:29,191 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-01 20:48:29,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:48:29,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-01 20:48:29,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:29,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:29,250 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-01 20:48:29,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:48:29,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:29,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:29,271 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand 12 states. [2019-01-01 20:48:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:29,318 INFO L93 Difference]: Finished difference Result 319 states and 357 transitions. [2019-01-01 20:48:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:29,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-01-01 20:48:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:29,320 INFO L225 Difference]: With dead ends: 319 [2019-01-01 20:48:29,320 INFO L226 Difference]: Without dead ends: 242 [2019-01-01 20:48:29,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 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-01 20:48:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-01 20:48:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 222. [2019-01-01 20:48:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-01 20:48:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 260 transitions. [2019-01-01 20:48:29,333 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 260 transitions. Word has length 90 [2019-01-01 20:48:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:29,334 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 260 transitions. [2019-01-01 20:48:29,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 260 transitions. [2019-01-01 20:48:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 20:48:29,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:29,339 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1] [2019-01-01 20:48:29,339 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1359938858, now seen corresponding path program 7 times [2019-01-01 20:48:29,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:29,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:48:29,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:29,507 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-01 20:48:29,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:29,507 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-01 20:48:29,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:29,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:29,556 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-01 20:48:29,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:29,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:48:29,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:48:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:48:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:48:29,574 INFO L87 Difference]: Start difference. First operand 222 states and 260 transitions. Second operand 11 states. [2019-01-01 20:48:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:29,631 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2019-01-01 20:48:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:48:29,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-01-01 20:48:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:29,633 INFO L225 Difference]: With dead ends: 243 [2019-01-01 20:48:29,633 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 20:48:29,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 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-01 20:48:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 20:48:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-01 20:48:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 20:48:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 101 transitions. [2019-01-01 20:48:29,639 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 101 transitions. Word has length 91 [2019-01-01 20:48:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:29,639 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 101 transitions. [2019-01-01 20:48:29,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:48:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 101 transitions. [2019-01-01 20:48:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-01 20:48:29,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:48:29,640 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1] [2019-01-01 20:48:29,641 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:48:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:48:29,641 INFO L82 PathProgramCache]: Analyzing trace with hash -498811939, now seen corresponding path program 8 times [2019-01-01 20:48:29,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:48:29,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:48:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:48:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:48:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:48:29,931 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-01 20:48:29,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:48:29,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 20:48:29,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:48:29,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:48:29,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:48:29,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:48:29,987 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-01 20:48:30,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:48:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:48:30,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:48:30,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:48:30,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:48:30,007 INFO L87 Difference]: Start difference. First operand 102 states and 101 transitions. Second operand 12 states. [2019-01-01 20:48:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:48:30,040 INFO L93 Difference]: Finished difference Result 102 states and 101 transitions. [2019-01-01 20:48:30,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:48:30,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-01-01 20:48:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:48:30,042 INFO L225 Difference]: With dead ends: 102 [2019-01-01 20:48:30,042 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:48:30,042 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-01 20:48:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:48:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:48:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:48:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:48:30,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2019-01-01 20:48:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:48:30,043 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:48:30,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:48:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:48:30,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:48:30,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:48:31,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:31,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:32,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:33,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:34,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:35,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:36,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:37,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:37,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:37,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:37,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:38,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:39,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:40,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:40,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:41,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:41,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:41,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:41,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:41,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:42,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:42,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:42,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:42,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:42,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:43,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:43,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:43,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:44,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:44,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:45,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:45,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:45,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:46,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:47,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:48,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:48,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:48,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:48,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:48,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:49,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:49,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:49,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:49,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:50,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:50,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:50,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:51,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:54,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:54,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:54,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:56,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:56,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:48:58,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:00,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:01,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:01,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:02,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:02,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:02,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:03,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:07,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:10,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:15,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:15,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:17,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:20,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:20,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:27,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:27,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:30,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:33,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:49:33,896 WARN L181 SmtUtils]: Spent 1.06 m on a formula simplification. DAG size of input: 4654 DAG size of output: 3109 [2019-01-01 20:51:50,859 WARN L181 SmtUtils]: Spent 2.28 m on a formula simplification. DAG size of input: 2580 DAG size of output: 409 [2019-01-01 20:51:50,873 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-01 20:51:50,874 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-01 20:51:50,875 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2019-01-01 20:51:50,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2019-01-01 20:51:50,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-01 20:51:50,876 INFO L451 ceAbstractionStarter]: At program point L34(lines 13 35) the Hoare annotation is: true [2019-01-01 20:51:50,876 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-01 20:51:50,876 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-01 20:51:50,876 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-01 20:51:50,877 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-01 20:51:50,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-01 20:51:50,877 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2019-01-01 20:51:50,880 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-01 20:51:50,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:51:50 BoogieIcfgContainer [2019-01-01 20:51:50,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:51:50,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:51:50,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:51:50,987 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:51:50,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:47:36" (3/4) ... [2019-01-01 20:51:50,993 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:51:51,010 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 20:51:51,010 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:51:51,103 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:51:51,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:51:51,106 INFO L168 Benchmark]: Toolchain (without parser) took 255940.33 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 943.3 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-01-01 20:51:51,108 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:51:51,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 931.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:51:51,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:51:51,109 INFO L168 Benchmark]: Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:51:51,109 INFO L168 Benchmark]: RCFGBuilder took 531.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:51:51,113 INFO L168 Benchmark]: TraceAbstraction took 254954.06 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -895.3 MB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2019-01-01 20:51:51,114 INFO L168 Benchmark]: Witness Printer took 121.24 ms. Allocated memory is still 5.0 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:51:51,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.07 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 931.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 531.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 254954.06 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -895.3 MB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. * Witness Printer took 121.24 ms. Allocated memory is still 5.0 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: 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: 24]: 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: 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, 254.7s OverallTime, 44 OverallIterations, 11 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 200.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1114 SDtfs, 6707 SDslu, 5061 SDs, 0 SdLazy, 1782 SolverSat, 967 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1883 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 10.4s 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: 16.6s AutomataMinimizationTime, 44 MinimizatonAttempts, 130600 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 1768 NumberOfFragments, 5870 HoareAnnotationTreeSize, 2 FomulaSimplifications, 653905 FormulaSimplificationTreeSizeReduction, 63.8s HoareSimplificationTime, 2 FomulaSimplificationsInter, 133427 FormulaSimplificationTreeSizeReductionInter, 136.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.8s 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...