./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:19:50,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:19:50,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:19:50,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:19:50,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:19:50,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:19:50,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:19:50,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:19:50,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:19:50,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:19:50,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:19:50,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:19:50,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:19:50,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:19:50,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:19:50,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:19:50,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:19:50,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:19:50,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:19:50,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:19:50,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:19:50,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:19:50,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:19:50,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:19:50,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:19:50,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:19:50,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:19:50,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:19:50,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:19:50,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:19:50,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:19:50,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:19:50,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:19:50,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:19:50,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:19:50,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:19:50,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:19:50,671 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:19:50,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:19:50,672 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:19:50,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:19:50,673 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:19:50,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:19:50,673 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:19:50,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:19:50,674 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:19:50,675 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:19:50,675 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:19:50,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:19:50,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:19:50,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:19:50,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:19:50,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:19:50,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:19:50,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:19:50,676 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:19:50,676 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:19:50,677 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:19:50,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:19:50,677 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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2019-01-14 01:19:50,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:19:50,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:19:50,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:19:50,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:19:50,739 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:19:50,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 01:19:50,797 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2c432ae/f20ee31374db4c68b6edc1290d716429/FLAG1773ad058 [2019-01-14 01:19:51,185 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:19:51,186 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 01:19:51,193 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2c432ae/f20ee31374db4c68b6edc1290d716429/FLAG1773ad058 [2019-01-14 01:19:51,568 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2c432ae/f20ee31374db4c68b6edc1290d716429 [2019-01-14 01:19:51,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:19:51,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:19:51,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:19:51,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:19:51,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:19:51,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1944673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51, skipping insertion in model container [2019-01-14 01:19:51,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:19:51,610 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:19:51,818 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:19:51,824 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:19:51,859 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:19:51,877 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:19:51,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51 WrapperNode [2019-01-14 01:19:51,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:19:51,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:19:51,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:19:51,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:19:51,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:19:51,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:19:51,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:19:51,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:19:51,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... [2019-01-14 01:19:51,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:19:51,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:19:51,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:19:51,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:19:51,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:19:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:19:52,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:19:52,432 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:19:52,436 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 01:19:52,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:19:52 BoogieIcfgContainer [2019-01-14 01:19:52,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:19:52,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:19:52,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:19:52,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:19:52,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:19:51" (1/3) ... [2019-01-14 01:19:52,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b59477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:19:52, skipping insertion in model container [2019-01-14 01:19:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:19:51" (2/3) ... [2019-01-14 01:19:52,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b59477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:19:52, skipping insertion in model container [2019-01-14 01:19:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:19:52" (3/3) ... [2019-01-14 01:19:52,445 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2019-01-14 01:19:52,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:19:52,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 01:19:52,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 01:19:52,505 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:19:52,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:19:52,506 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:19:52,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:19:52,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:19:52,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:19:52,507 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:19:52,507 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:19:52,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:19:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-01-14 01:19:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:19:52,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:52,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:19:52,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 29685899, now seen corresponding path program 1 times [2019-01-14 01:19:52,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:52,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:52,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:52,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:52,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 01:19:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 01:19:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:19:52,674 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-01-14 01:19:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:52,690 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-01-14 01:19:52,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 01:19:52,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-01-14 01:19:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:52,699 INFO L225 Difference]: With dead ends: 50 [2019-01-14 01:19:52,699 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 01:19:52,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 01:19:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 01:19:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 01:19:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 01:19:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-14 01:19:52,735 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 5 [2019-01-14 01:19:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 01:19:52,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 01:19:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-01-14 01:19:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:19:52,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:52,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:19:52,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash 29685000, now seen corresponding path program 1 times [2019-01-14 01:19:52,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:52,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:52,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:52,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:52,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:52,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:52,831 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-01-14 01:19:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,045 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-14 01:19:53,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 01:19:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,047 INFO L225 Difference]: With dead ends: 41 [2019-01-14 01:19:53,047 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 01:19:53,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 01:19:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-01-14 01:19:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 01:19:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-01-14 01:19:53,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2019-01-14 01:19:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,055 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-01-14 01:19:53,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-01-14 01:19:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:19:53,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:19:53,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 29685034, now seen corresponding path program 1 times [2019-01-14 01:19:53,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:53,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,111 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-01-14 01:19:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,190 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-01-14 01:19:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 01:19:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,193 INFO L225 Difference]: With dead ends: 34 [2019-01-14 01:19:53,193 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 01:19:53,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 01:19:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-01-14 01:19:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 01:19:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-14 01:19:53,199 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2019-01-14 01:19:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,200 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 01:19:53,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-01-14 01:19:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:19:53,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:19:53,202 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 920235084, now seen corresponding path program 1 times [2019-01-14 01:19:53,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:53,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:53,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,277 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-01-14 01:19:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,319 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-01-14 01:19:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 01:19:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,323 INFO L225 Difference]: With dead ends: 45 [2019-01-14 01:19:53,323 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 01:19:53,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 01:19:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-14 01:19:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:19:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-01-14 01:19:53,331 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2019-01-14 01:19:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,331 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-01-14 01:19:53,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-01-14 01:19:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:19:53,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:19:53,335 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 920236110, now seen corresponding path program 1 times [2019-01-14 01:19:53,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:53,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:53,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,395 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-01-14 01:19:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,466 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-01-14 01:19:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 01:19:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,468 INFO L225 Difference]: With dead ends: 31 [2019-01-14 01:19:53,468 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 01:19:53,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 01:19:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 01:19:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:19:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-01-14 01:19:53,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 6 [2019-01-14 01:19:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,482 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-14 01:19:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-01-14 01:19:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:19:53,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:53,483 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1537451600, now seen corresponding path program 1 times [2019-01-14 01:19:53,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:53,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:19:53,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,552 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2019-01-14 01:19:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,637 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-14 01:19:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 01:19:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,639 INFO L225 Difference]: With dead ends: 30 [2019-01-14 01:19:53,639 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 01:19:53,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 01:19:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-14 01:19:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:19:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-14 01:19:53,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-01-14 01:19:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 01:19:53,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-01-14 01:19:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:19:53,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:53,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -416359280, now seen corresponding path program 1 times [2019-01-14 01:19:53,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:53,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 01:19:53,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:19:53,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:19:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,724 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 3 states. [2019-01-14 01:19:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:53,761 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-14 01:19:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:19:53,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 01:19:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:53,763 INFO L225 Difference]: With dead ends: 29 [2019-01-14 01:19:53,763 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 01:19:53,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:19:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 01:19:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 01:19:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:19:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-14 01:19:53,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 8 [2019-01-14 01:19:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:53,771 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 01:19:53,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:19:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-01-14 01:19:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 01:19:53,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:53,772 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:19:53,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -52819969, now seen corresponding path program 1 times [2019-01-14 01:19:53,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:53,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:53,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:53,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:53,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:53,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:19:53,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:19:53,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:19:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:53,937 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-01-14 01:19:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:54,033 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2019-01-14 01:19:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:19:54,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 01:19:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:54,034 INFO L225 Difference]: With dead ends: 54 [2019-01-14 01:19:54,034 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 01:19:54,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 01:19:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-01-14 01:19:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 01:19:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-01-14 01:19:54,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2019-01-14 01:19:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:54,042 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-01-14 01:19:54,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:19:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-01-14 01:19:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:19:54,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:54,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:54,043 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:54,044 INFO L82 PathProgramCache]: Analyzing trace with hash -689307342, now seen corresponding path program 1 times [2019-01-14 01:19:54,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:54,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:54,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:19:54,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:19:54,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:19:54,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,094 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2019-01-14 01:19:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:54,183 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-01-14 01:19:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:19:54,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-01-14 01:19:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:54,186 INFO L225 Difference]: With dead ends: 32 [2019-01-14 01:19:54,186 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 01:19:54,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:19:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 01:19:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 01:19:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 01:19:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-14 01:19:54,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 10 [2019-01-14 01:19:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:54,194 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 01:19:54,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:19:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-01-14 01:19:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 01:19:54,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:54,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:54,195 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash 106308951, now seen corresponding path program 1 times [2019-01-14 01:19:54,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:54,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:54,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:54,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:54,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:19:54,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:19:54,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:19:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,271 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 4 states. [2019-01-14 01:19:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:54,471 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-01-14 01:19:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:19:54,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-14 01:19:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:54,473 INFO L225 Difference]: With dead ends: 34 [2019-01-14 01:19:54,474 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 01:19:54,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:19:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 01:19:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2019-01-14 01:19:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 01:19:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-14 01:19:54,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-01-14 01:19:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:54,480 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-14 01:19:54,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:19:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-01-14 01:19:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:19:54,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:54,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:54,481 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash -999444262, now seen corresponding path program 1 times [2019-01-14 01:19:54,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:54,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:19:54,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:54,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:19:54,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:19:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:19:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,533 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 4 states. [2019-01-14 01:19:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:54,631 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-01-14 01:19:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:19:54,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 01:19:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:54,634 INFO L225 Difference]: With dead ends: 53 [2019-01-14 01:19:54,634 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 01:19:54,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:19:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 01:19:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2019-01-14 01:19:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 01:19:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-14 01:19:54,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 12 [2019-01-14 01:19:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:54,642 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 01:19:54,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:19:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-01-14 01:19:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:19:54,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:54,643 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:54,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash -999444228, now seen corresponding path program 1 times [2019-01-14 01:19:54,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:54,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:54,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:54,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:54,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:54,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:54,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:54,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:19:54,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:19:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:19:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,814 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 4 states. [2019-01-14 01:19:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:54,859 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2019-01-14 01:19:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:19:54,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 01:19:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:54,861 INFO L225 Difference]: With dead ends: 62 [2019-01-14 01:19:54,861 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 01:19:54,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:19:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 01:19:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2019-01-14 01:19:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 01:19:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2019-01-14 01:19:54,874 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 12 [2019-01-14 01:19:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:54,876 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2019-01-14 01:19:54,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:19:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2019-01-14 01:19:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 01:19:54,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:54,877 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2019-01-14 01:19:54,878 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1890502518, now seen corresponding path program 2 times [2019-01-14 01:19:54,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:54,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:55,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:55,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:55,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:19:55,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 01:19:55,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:19:55,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 01:19:55,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-01-14 01:19:55,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:19:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:19:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:19:55,163 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 7 states. [2019-01-14 01:19:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:55,553 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2019-01-14 01:19:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:19:55,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-14 01:19:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:55,554 INFO L225 Difference]: With dead ends: 80 [2019-01-14 01:19:55,554 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 01:19:55,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:19:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 01:19:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 45. [2019-01-14 01:19:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 01:19:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-01-14 01:19:55,563 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 13 [2019-01-14 01:19:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:55,563 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-01-14 01:19:55,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:19:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-01-14 01:19:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 01:19:55,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:55,564 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:55,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash 656583171, now seen corresponding path program 1 times [2019-01-14 01:19:55,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:55,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:55,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:55,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:19:55,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:55,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:55,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:55,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:55,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 01:19:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:19:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:19:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:19:55,721 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 6 states. [2019-01-14 01:19:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:55,903 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2019-01-14 01:19:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:19:55,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-14 01:19:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:55,905 INFO L225 Difference]: With dead ends: 78 [2019-01-14 01:19:55,905 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 01:19:55,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:19:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 01:19:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 01:19:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 01:19:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-14 01:19:55,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 16 [2019-01-14 01:19:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:55,915 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-14 01:19:55,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:19:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-01-14 01:19:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:19:55,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:55,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:55,919 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 471235363, now seen corresponding path program 1 times [2019-01-14 01:19:55,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:55,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:56,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:56,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:56,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:56,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:56,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-01-14 01:19:56,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:19:56,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:19:56,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:19:56,219 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 10 states. [2019-01-14 01:19:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:56,815 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2019-01-14 01:19:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:19:56,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-01-14 01:19:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:56,817 INFO L225 Difference]: With dead ends: 176 [2019-01-14 01:19:56,818 INFO L226 Difference]: Without dead ends: 175 [2019-01-14 01:19:56,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-01-14 01:19:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-14 01:19:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 87. [2019-01-14 01:19:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 01:19:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-01-14 01:19:56,834 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 17 [2019-01-14 01:19:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:56,834 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-01-14 01:19:56,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:19:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-01-14 01:19:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:19:56,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:56,835 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-01-14 01:19:56,836 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash -415013654, now seen corresponding path program 2 times [2019-01-14 01:19:56,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:56,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:19:56,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:56,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:56,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:19:56,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 01:19:56,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:19:56,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 01:19:57,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:57,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2] total 6 [2019-01-14 01:19:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:19:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:19:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:19:57,039 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 7 states. [2019-01-14 01:19:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:57,189 INFO L93 Difference]: Finished difference Result 180 states and 219 transitions. [2019-01-14 01:19:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:19:57,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-14 01:19:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:57,193 INFO L225 Difference]: With dead ends: 180 [2019-01-14 01:19:57,193 INFO L226 Difference]: Without dead ends: 179 [2019-01-14 01:19:57,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:19:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-14 01:19:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 50. [2019-01-14 01:19:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-14 01:19:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-01-14 01:19:57,215 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 19 [2019-01-14 01:19:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:57,215 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-01-14 01:19:57,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:19:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-01-14 01:19:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 01:19:57,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:57,217 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:19:57,217 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash -37556911, now seen corresponding path program 1 times [2019-01-14 01:19:57,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:57,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:57,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:19:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:19:57,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:57,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:57,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:19:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:19:57,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:19:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:19:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:19:57,401 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 9 states. [2019-01-14 01:19:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:58,462 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-01-14 01:19:58,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:19:58,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-14 01:19:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:58,464 INFO L225 Difference]: With dead ends: 146 [2019-01-14 01:19:58,464 INFO L226 Difference]: Without dead ends: 145 [2019-01-14 01:19:58,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:19:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-14 01:19:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 55. [2019-01-14 01:19:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 01:19:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-01-14 01:19:58,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 33 [2019-01-14 01:19:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:58,488 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-01-14 01:19:58,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:19:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-01-14 01:19:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 01:19:58,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:58,493 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 01:19:58,493 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1618909864, now seen corresponding path program 2 times [2019-01-14 01:19:58,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:19:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:19:58,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:58,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:19:58,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:19:58,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:19:58,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:19:58,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:19:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 01:19:58,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:19:58,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:19:58,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:19:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:19:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:19:58,928 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 10 states. [2019-01-14 01:19:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:59,333 INFO L93 Difference]: Finished difference Result 161 states and 185 transitions. [2019-01-14 01:19:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 01:19:59,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-14 01:19:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:59,336 INFO L225 Difference]: With dead ends: 161 [2019-01-14 01:19:59,336 INFO L226 Difference]: Without dead ends: 160 [2019-01-14 01:19:59,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:19:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-14 01:19:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 60. [2019-01-14 01:19:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 01:19:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-01-14 01:19:59,351 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 38 [2019-01-14 01:19:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:59,351 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-01-14 01:19:59,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:19:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-01-14 01:19:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 01:19:59,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:59,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:59,353 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:59,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1685598945, now seen corresponding path program 3 times [2019-01-14 01:19:59,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:59,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:59,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:19:59,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 01:19:59,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:19:59,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 01:19:59,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:19:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:19:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:19:59,413 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2019-01-14 01:19:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:19:59,755 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2019-01-14 01:19:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:19:59,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-14 01:19:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:19:59,757 INFO L225 Difference]: With dead ends: 147 [2019-01-14 01:19:59,757 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 01:19:59,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:19:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 01:19:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2019-01-14 01:19:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 01:19:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-01-14 01:19:59,781 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 39 [2019-01-14 01:19:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:19:59,781 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-01-14 01:19:59,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:19:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-01-14 01:19:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 01:19:59,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:19:59,788 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:19:59,789 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:19:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:19:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1243466243, now seen corresponding path program 4 times [2019-01-14 01:19:59,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:19:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:19:59,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:59,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:19:59,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:19:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:19:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 01:19:59,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:19:59,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:20:00,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:20:00,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:20:00,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:20:00,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:20:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-14 01:20:00,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:20:00,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 12 [2019-01-14 01:20:00,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:20:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:20:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:20:00,078 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 13 states. [2019-01-14 01:20:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:20:00,661 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2019-01-14 01:20:00,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 01:20:00,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-01-14 01:20:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:20:00,662 INFO L225 Difference]: With dead ends: 159 [2019-01-14 01:20:00,662 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:20:00,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2019-01-14 01:20:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:20:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:20:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:20:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:20:00,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-14 01:20:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:20:00,664 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:20:00,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:20:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:20:00,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:20:00,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:20:00,872 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2019-01-14 01:20:01,130 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2019-01-14 01:20:01,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 01:20:01,583 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 128 [2019-01-14 01:20:03,972 WARN L181 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 103 DAG size of output: 30 [2019-01-14 01:20:04,737 WARN L181 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 36 [2019-01-14 01:20:05,327 WARN L181 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-01-14 01:20:05,342 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse2 (<= 0 ULTIMATE.start_main_~N~0)) (.cse3 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse4 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse1 (<= ULTIMATE.start_main_~m~0 2147483647)) (.cse5 (and .cse0 (and .cse2 (<= 0 ULTIMATE.start_main_~j~0) .cse3 .cse4)))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) (and .cse1 (and (<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0) .cse5))) (and (<= ULTIMATE.start_main_~m~0 0) (<= ULTIMATE.start_main_~j~0 0) .cse5)))) [2019-01-14 01:20:05,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L451 ceAbstractionStarter]: At program point L36(lines 13 37) the Hoare annotation is: true [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L444 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse0 (and (<= ULTIMATE.start_main_~m~0 2147483647) (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= 0 ULTIMATE.start_main_~k~0) (<= 0 ULTIMATE.start_main_~N~0) (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~k~0 2147483646) (<= ULTIMATE.start_main_~N~0 2147483647) (<= 0 ULTIMATE.start_main_~i~0))))) (or (and (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1)) .cse0) (and (<= ULTIMATE.start_main_~i~0 0) .cse0))) [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2019-01-14 01:20:05,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse3 (<= ULTIMATE.start_main_~n~0 2147483647)) (.cse4 (<= 0 ULTIMATE.start_main_~N~0)) (.cse8 (<= ULTIMATE.start_main_~j~0 0)) (.cse5 (<= 0 ULTIMATE.start_main_~j~0)) (.cse6 (<= ULTIMATE.start_main_~i~0 2147483646)) (.cse9 (<= ULTIMATE.start_main_~N~0 2147483647)) (.cse7 (<= 0 ULTIMATE.start_main_~i~0))) (let ((.cse0 (and .cse3 .cse4 .cse8 .cse5 .cse6 .cse9 .cse7)) (.cse2 (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))) (.cse1 (<= ULTIMATE.start_main_~m~0 2147483647))) (or (and (and .cse0 .cse1) (<= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0) .cse2) (and .cse0 (<= ULTIMATE.start_main_~m~0 0)) (and (and .cse1 (and .cse3 (<= 0 ULTIMATE.start_main_~k~0) .cse4 .cse5 (<= ULTIMATE.start_main_~k~0 2147483646) .cse6 .cse7)) (<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1)) .cse2) (and (<= ULTIMATE.start_main_~i~0 0) .cse3 .cse1 .cse4 .cse8 .cse5 .cse9 .cse7)))) [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2019-01-14 01:20:05,344 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-14 01:20:05,345 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-14 01:20:05,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2019-01-14 01:20:05,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:20:05 BoogieIcfgContainer [2019-01-14 01:20:05,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:20:05,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:20:05,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:20:05,367 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:20:05,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:19:52" (3/4) ... [2019-01-14 01:20:05,371 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:20:05,381 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:20:05,381 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:20:05,434 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:20:05,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:20:05,436 INFO L168 Benchmark]: Toolchain (without parser) took 13863.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -64.1 MB). Peak memory consumption was 216.4 MB. Max. memory is 11.5 GB. [2019-01-14 01:20:05,438 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:20:05,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.87 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:20:05,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.63 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:20:05,439 INFO L168 Benchmark]: Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:20:05,439 INFO L168 Benchmark]: RCFGBuilder took 500.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 01:20:05,442 INFO L168 Benchmark]: TraceAbstraction took 12928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.3 MB). Peak memory consumption was 372.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:20:05,443 INFO L168 Benchmark]: Witness Printer took 68.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:20:05,448 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.87 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.63 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 500.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12928.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.3 MB). Peak memory consumption was 372.0 MB. Max. memory is 11.5 GB. * Witness Printer took 68.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= N) && N <= 2147483647) && 0 <= i) || ((N <= i && N <= k + 1) && m <= 2147483647 && m <= j && n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i)) || ((m <= 0 && j <= 0) && n <= 2147483647 && ((0 <= N && 0 <= j) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((((n <= 2147483647 && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && m <= 2147483647) && N <= i) && N <= k + 1) || (((((((n <= 2147483647 && 0 <= N) && j <= 0) && 0 <= j) && i <= 2147483646) && N <= 2147483647) && 0 <= i) && m <= 0)) || (((m <= 2147483647 && (((((n <= 2147483647 && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && i <= 2147483646) && 0 <= i) && N <= i + 1) && N <= k + 1)) || (((((((i <= 0 && n <= 2147483647) && m <= 2147483647) && 0 <= N) && j <= 0) && 0 <= j) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((N <= i + 1 && N <= k + 1) && m <= 2147483647 && (((((n <= 2147483647 && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) || (i <= 0 && m <= 2147483647 && (((((n <= 2147483647 && 0 <= k) && 0 <= N) && 0 <= j) && k <= 2147483646) && N <= 2147483647) && 0 <= i) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 8 error locations. SAFE Result, 12.8s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 308 SDtfs, 978 SDslu, 492 SDs, 0 SdLazy, 674 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 565 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 52 NumberOfFragments, 271 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2673336 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 849014 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 506 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 32475 SizeOfPredicates, 18 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 103/374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...