./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45b185c6c694406b0734db5727dff1b8fd93ebcf .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:02:24,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:02:24,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:02:24,137 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:02:24,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:02:24,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:02:24,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:02:24,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:02:24,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:02:24,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:02:24,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:02:24,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:02:24,148 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:02:24,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:02:24,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:02:24,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:02:24,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:02:24,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:02:24,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:02:24,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:02:24,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:02:24,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:02:24,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:02:24,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:02:24,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:02:24,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:02:24,168 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:02:24,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:02:24,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:02:24,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:02:24,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:02:24,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:02:24,173 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:02:24,173 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:02:24,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:02:24,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:02:24,176 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:02:24,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:02:24,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:02:24,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:02:24,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:02:24,199 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:02:24,200 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:02:24,200 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:02:24,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:02:24,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:02:24,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:02:24,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:02:24,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:02:24,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:02:24,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:02:24,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:02:24,207 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:02:24,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:02:24,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:02:24,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:02:24,208 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:02:24,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:02:24,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:02:24,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:02:24,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:02:24,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:02:24,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:02:24,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:02:24,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:02:24,214 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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2018-12-30 16:02:24,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:02:24,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:02:24,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:02:24,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:02:24,295 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:02:24,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-30 16:02:24,359 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1012c708b/97fc60cefa2f47fa83eca623bc27ea37/FLAG1aa833ddd [2018-12-30 16:02:24,806 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:02:24,808 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-30 16:02:24,816 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1012c708b/97fc60cefa2f47fa83eca623bc27ea37/FLAG1aa833ddd [2018-12-30 16:02:25,137 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1012c708b/97fc60cefa2f47fa83eca623bc27ea37 [2018-12-30 16:02:25,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:02:25,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:02:25,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:02:25,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:02:25,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:02:25,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12db68d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25, skipping insertion in model container [2018-12-30 16:02:25,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:02:25,195 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:02:25,508 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:02:25,513 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:02:25,554 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:02:25,582 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:02:25,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25 WrapperNode [2018-12-30 16:02:25,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:02:25,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:02:25,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:02:25,584 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:02:25,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:02:25,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:02:25,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:02:25,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:02:25,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (1/1) ... [2018-12-30 16:02:25,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:02:25,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:02:25,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:02:25,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:02:25,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (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 [2018-12-30 16:02:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:02:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:02:26,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:02:26,646 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-30 16:02:26,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:26 BoogieIcfgContainer [2018-12-30 16:02:26,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:02:26,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:02:26,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:02:26,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:02:26,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:02:25" (1/3) ... [2018-12-30 16:02:26,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1f186b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:02:26, skipping insertion in model container [2018-12-30 16:02:26,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:02:25" (2/3) ... [2018-12-30 16:02:26,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1f186b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:02:26, skipping insertion in model container [2018-12-30 16:02:26,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:26" (3/3) ... [2018-12-30 16:02:26,657 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-30 16:02:26,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:02:26,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:02:26,694 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:02:26,728 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:02:26,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:02:26,729 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:02:26,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:02:26,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:02:26,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:02:26,730 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:02:26,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:02:26,730 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:02:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-12-30 16:02:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:02:26,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:26,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:26,762 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2018-12-30 16:02:26,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:26,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:26,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:26,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:26,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:26,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,015 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2018-12-30 16:02:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:27,076 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2018-12-30 16:02:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:27,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:02:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:27,091 INFO L225 Difference]: With dead ends: 149 [2018-12-30 16:02:27,091 INFO L226 Difference]: Without dead ends: 67 [2018-12-30 16:02:27,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-30 16:02:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-30 16:02:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-30 16:02:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2018-12-30 16:02:27,136 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2018-12-30 16:02:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:27,137 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2018-12-30 16:02:27,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2018-12-30 16:02:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:02:27,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:27,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:27,140 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:27,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:27,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2018-12-30 16:02:27,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:27,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:27,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:27,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:02:27,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:02:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:02:27,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:27,266 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2018-12-30 16:02:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:27,432 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2018-12-30 16:02:27,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:02:27,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-12-30 16:02:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:27,437 INFO L225 Difference]: With dead ends: 87 [2018-12-30 16:02:27,437 INFO L226 Difference]: Without dead ends: 67 [2018-12-30 16:02:27,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:02:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-30 16:02:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-30 16:02:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-30 16:02:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2018-12-30 16:02:27,450 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2018-12-30 16:02:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:27,450 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2018-12-30 16:02:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:02:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2018-12-30 16:02:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:02:27,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:27,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:27,455 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2018-12-30 16:02:27,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:27,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:27,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:27,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:27,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,625 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2018-12-30 16:02:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:27,804 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2018-12-30 16:02:27,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:27,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:02:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:27,807 INFO L225 Difference]: With dead ends: 121 [2018-12-30 16:02:27,808 INFO L226 Difference]: Without dead ends: 75 [2018-12-30 16:02:27,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-30 16:02:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-12-30 16:02:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-30 16:02:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2018-12-30 16:02:27,818 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2018-12-30 16:02:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2018-12-30 16:02:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2018-12-30 16:02:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:02:27,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:27,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:27,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2018-12-30 16:02:27,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:27,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:28,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:28,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:02:28,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:02:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:02:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:28,019 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2018-12-30 16:02:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:28,189 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2018-12-30 16:02:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:02:28,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-12-30 16:02:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:28,192 INFO L225 Difference]: With dead ends: 155 [2018-12-30 16:02:28,192 INFO L226 Difference]: Without dead ends: 90 [2018-12-30 16:02:28,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:02:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-30 16:02:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2018-12-30 16:02:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-30 16:02:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2018-12-30 16:02:28,207 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2018-12-30 16:02:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:28,208 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2018-12-30 16:02:28,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:02:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2018-12-30 16:02:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:02:28,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:28,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:28,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2018-12-30 16:02:28,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:28,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:28,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:28,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:02:28,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:02:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:02:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,342 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2018-12-30 16:02:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:28,605 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2018-12-30 16:02:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:02:28,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:02:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:28,606 INFO L225 Difference]: With dead ends: 108 [2018-12-30 16:02:28,606 INFO L226 Difference]: Without dead ends: 58 [2018-12-30 16:02:28,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:02:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-30 16:02:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-30 16:02:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-30 16:02:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2018-12-30 16:02:28,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2018-12-30 16:02:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:28,621 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2018-12-30 16:02:28,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:02:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2018-12-30 16:02:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:02:28,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:28,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:28,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2018-12-30 16:02:28,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:28,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:28,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:02:28,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:02:28,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:02:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:28,757 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2018-12-30 16:02:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:28,983 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2018-12-30 16:02:28,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:02:28,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-30 16:02:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:28,989 INFO L225 Difference]: With dead ends: 110 [2018-12-30 16:02:28,989 INFO L226 Difference]: Without dead ends: 63 [2018-12-30 16:02:28,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:02:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-30 16:02:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2018-12-30 16:02:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-30 16:02:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2018-12-30 16:02:28,997 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2018-12-30 16:02:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:28,997 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2018-12-30 16:02:28,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:02:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2018-12-30 16:02:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:02:29,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:29,000 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:29,000 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2018-12-30 16:02:29,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:29,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:29,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:29,104 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 [2018-12-30 16:02:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:29,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:29,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:29,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-12-30 16:02:29,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:02:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:02:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:02:29,224 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2018-12-30 16:02:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:29,384 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2018-12-30 16:02:29,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:02:29,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-30 16:02:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:29,392 INFO L225 Difference]: With dead ends: 133 [2018-12-30 16:02:29,392 INFO L226 Difference]: Without dead ends: 87 [2018-12-30 16:02:29,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:02:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-30 16:02:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2018-12-30 16:02:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-30 16:02:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2018-12-30 16:02:29,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2018-12-30 16:02:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:29,402 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2018-12-30 16:02:29,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:02:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2018-12-30 16:02:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:02:29,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:29,404 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:29,404 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:29,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2018-12-30 16:02:29,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:29,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:29,694 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 [2018-12-30 16:02:29,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:29,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 16:02:29,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:02:29,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-12-30 16:02:29,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 16:02:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 16:02:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:02:29,929 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 9 states. [2018-12-30 16:02:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:31,001 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2018-12-30 16:02:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 16:02:31,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-30 16:02:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:31,004 INFO L225 Difference]: With dead ends: 141 [2018-12-30 16:02:31,004 INFO L226 Difference]: Without dead ends: 94 [2018-12-30 16:02:31,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-12-30 16:02:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-30 16:02:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2018-12-30 16:02:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-30 16:02:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2018-12-30 16:02:31,012 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 34 [2018-12-30 16:02:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:31,012 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2018-12-30 16:02:31,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 16:02:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2018-12-30 16:02:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:02:31,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:31,013 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:31,014 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:31,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash 575905444, now seen corresponding path program 1 times [2018-12-30 16:02:31,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:31,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:31,197 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 [2018-12-30 16:02:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:31,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:31,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:31,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-12-30 16:02:31,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 16:02:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 16:02:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:02:31,292 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand 6 states. [2018-12-30 16:02:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:31,626 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2018-12-30 16:02:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 16:02:31,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-30 16:02:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:31,628 INFO L225 Difference]: With dead ends: 136 [2018-12-30 16:02:31,628 INFO L226 Difference]: Without dead ends: 90 [2018-12-30 16:02:31,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:02:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-30 16:02:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-12-30 16:02:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-30 16:02:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2018-12-30 16:02:31,636 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 37 [2018-12-30 16:02:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:31,637 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2018-12-30 16:02:31,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 16:02:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2018-12-30 16:02:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-30 16:02:31,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:31,638 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:31,638 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:31,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1518183843, now seen corresponding path program 1 times [2018-12-30 16:02:31,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:31,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:32,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:32,090 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 [2018-12-30 16:02:32,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:32,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-30 16:02:32,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:02:32,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-30 16:02:32,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 16:02:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 16:02:32,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-30 16:02:32,309 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand 10 states. [2018-12-30 16:02:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:32,618 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2018-12-30 16:02:32,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 16:02:32,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-30 16:02:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:32,621 INFO L225 Difference]: With dead ends: 126 [2018-12-30 16:02:32,621 INFO L226 Difference]: Without dead ends: 79 [2018-12-30 16:02:32,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-30 16:02:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-30 16:02:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2018-12-30 16:02:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-30 16:02:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2018-12-30 16:02:32,629 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 39 [2018-12-30 16:02:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:32,629 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2018-12-30 16:02:32,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 16:02:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2018-12-30 16:02:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-30 16:02:32,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:32,630 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:32,630 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash 895397540, now seen corresponding path program 1 times [2018-12-30 16:02:32,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:32,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:32,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-30 16:02:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 16:02:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 16:02:32,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 16:02:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:02:32,773 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand 6 states. [2018-12-30 16:02:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:32,902 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-12-30 16:02:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 16:02:32,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-30 16:02:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:32,904 INFO L225 Difference]: With dead ends: 75 [2018-12-30 16:02:32,905 INFO L226 Difference]: Without dead ends: 65 [2018-12-30 16:02:32,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:02:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-30 16:02:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-30 16:02:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-30 16:02:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2018-12-30 16:02:32,911 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 40 [2018-12-30 16:02:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:32,911 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2018-12-30 16:02:32,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 16:02:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2018-12-30 16:02:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 16:02:32,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:32,913 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:32,913 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1599993153, now seen corresponding path program 1 times [2018-12-30 16:02:32,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:32,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:32,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:32,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:33,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:33,352 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 [2018-12-30 16:02:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:33,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:33,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:33,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2018-12-30 16:02:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:02:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:02:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:02:33,418 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 7 states. [2018-12-30 16:02:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:33,586 INFO L93 Difference]: Finished difference Result 139 states and 178 transitions. [2018-12-30 16:02:33,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:02:33,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-30 16:02:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:33,588 INFO L225 Difference]: With dead ends: 139 [2018-12-30 16:02:33,589 INFO L226 Difference]: Without dead ends: 93 [2018-12-30 16:02:33,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:02:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-30 16:02:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2018-12-30 16:02:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-30 16:02:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2018-12-30 16:02:33,601 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 41 [2018-12-30 16:02:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:33,601 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2018-12-30 16:02:33,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:02:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-12-30 16:02:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-30 16:02:33,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:33,609 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:33,609 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash 639640994, now seen corresponding path program 1 times [2018-12-30 16:02:33,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:33,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-30 16:02:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:02:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:02:34,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:02:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:02:34,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:02:34,122 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 7 states. [2018-12-30 16:02:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:34,377 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2018-12-30 16:02:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:02:34,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-30 16:02:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:34,379 INFO L225 Difference]: With dead ends: 96 [2018-12-30 16:02:34,379 INFO L226 Difference]: Without dead ends: 71 [2018-12-30 16:02:34,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-30 16:02:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-30 16:02:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-12-30 16:02:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-30 16:02:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-12-30 16:02:34,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2018-12-30 16:02:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:34,386 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-12-30 16:02:34,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:02:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2018-12-30 16:02:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-30 16:02:34,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:34,388 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:34,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2053101997, now seen corresponding path program 1 times [2018-12-30 16:02:34,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:34,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:34,509 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 [2018-12-30 16:02:34,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:34,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-30 16:02:34,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:02:34,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-12-30 16:02:34,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 16:02:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 16:02:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-30 16:02:34,764 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand 13 states. [2018-12-30 16:02:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:35,415 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2018-12-30 16:02:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 16:02:35,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-12-30 16:02:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:35,417 INFO L225 Difference]: With dead ends: 141 [2018-12-30 16:02:35,417 INFO L226 Difference]: Without dead ends: 74 [2018-12-30 16:02:35,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-12-30 16:02:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-30 16:02:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-12-30 16:02:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-30 16:02:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2018-12-30 16:02:35,426 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 47 [2018-12-30 16:02:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:35,426 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-12-30 16:02:35,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 16:02:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2018-12-30 16:02:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-30 16:02:35,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:35,427 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:35,427 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:35,427 INFO L82 PathProgramCache]: Analyzing trace with hash 14146971, now seen corresponding path program 1 times [2018-12-30 16:02:35,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:35,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:35,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:35,952 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 [2018-12-30 16:02:35,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:35,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:36,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 16:02:36,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-12-30 16:02:36,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 16:02:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 16:02:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:02:36,032 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 8 states. [2018-12-30 16:02:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:36,147 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-12-30 16:02:36,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 16:02:36,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-12-30 16:02:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:36,149 INFO L225 Difference]: With dead ends: 142 [2018-12-30 16:02:36,149 INFO L226 Difference]: Without dead ends: 96 [2018-12-30 16:02:36,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:02:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-30 16:02:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2018-12-30 16:02:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-30 16:02:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2018-12-30 16:02:36,158 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 52 [2018-12-30 16:02:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:36,159 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2018-12-30 16:02:36,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 16:02:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2018-12-30 16:02:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-30 16:02:36,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:02:36,162 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:02:36,162 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:02:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:02:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -36498052, now seen corresponding path program 1 times [2018-12-30 16:02:36,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:02:36,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:02:36,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:36,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:36,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:02:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:02:36,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 16:02:36,331 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 [2018-12-30 16:02:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:02:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:02:36,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 16:02:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-30 16:02:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 16:02:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2018-12-30 16:02:36,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-30 16:02:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-30 16:02:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-12-30 16:02:36,724 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand 15 states. [2018-12-30 16:02:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:02:37,690 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2018-12-30 16:02:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-30 16:02:37,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-12-30 16:02:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:02:37,691 INFO L225 Difference]: With dead ends: 109 [2018-12-30 16:02:37,691 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:02:37,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-12-30 16:02:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:02:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:02:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:02:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:02:37,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-30 16:02:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:02:37,694 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:02:37,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-30 16:02:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:02:37,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:02:37,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:02:38,005 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 16:02:38,253 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 8 [2018-12-30 16:02:38,697 WARN L181 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-12-30 16:02:38,990 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2018-12-30 16:02:38,990 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-12-30 16:02:38,990 INFO L448 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2018-12-30 16:02:38,990 INFO L448 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-12-30 16:02:38,990 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-30 16:02:38,991 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-12-30 16:02:38,991 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2018-12-30 16:02:38,991 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-12-30 16:02:38,991 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (and (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0) (= ULTIMATE.start_base2flt_~m 0)) [2018-12-30 16:02:38,991 INFO L444 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,991 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,991 INFO L444 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,991 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:02:38,991 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-12-30 16:02:38,992 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L70(lines 14 72) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_base2flt_#res|) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0) (<= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_base2flt_~m 0)) [2018-12-30 16:02:38,992 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,992 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,992 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L444 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L444 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L444 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:02:38,993 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L444 ceAbstractionStarter]: At program point L207(lines 137 209) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 |ULTIMATE.start_mulflt_#res|) (= 0 ULTIMATE.start_main_~zero~0)) (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2018-12-30 16:02:38,994 INFO L448 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2018-12-30 16:02:38,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,995 INFO L444 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L451 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2018-12-30 16:02:38,996 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,997 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,997 INFO L448 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,997 INFO L448 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2018-12-30 16:02:38,997 INFO L451 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2018-12-30 16:02:38,997 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2018-12-30 16:02:38,997 INFO L448 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2018-12-30 16:02:39,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:02:39 BoogieIcfgContainer [2018-12-30 16:02:39,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:02:39,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:02:39,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:02:39,030 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:02:39,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:02:26" (3/4) ... [2018-12-30 16:02:39,035 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:02:39,050 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-30 16:02:39,051 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-30 16:02:39,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= \result && 0 <= e) && __retres4 == 0) && \result <= 0) && m == 0 [2018-12-30 16:02:39,081 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 [2018-12-30 16:02:39,156 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:02:39,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:02:39,160 INFO L168 Benchmark]: Toolchain (without parser) took 14018.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -295.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:02:39,161 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-12-30 16:02:39,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:39,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:39,162 INFO L168 Benchmark]: Boogie Preprocessor took 62.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:39,163 INFO L168 Benchmark]: RCFGBuilder took 848.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:39,163 INFO L168 Benchmark]: TraceAbstraction took 12378.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.2 MB). Peak memory consumption was 355.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:02:39,163 INFO L168 Benchmark]: Witness Printer took 126.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:02:39,165 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.16 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 440.07 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 848.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12378.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -162.2 MB). Peak memory consumption was 355.6 MB. Max. memory is 11.5 GB. * Witness Printer took 126.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 <= e && __retres4 == 0) && m == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((0 <= \result && 0 <= e) && __retres4 == 0) && \result <= 0) && m == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sa) || (0 == __retres10 && 0 == zero)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. SAFE Result, 12.2s OverallTime, 16 OverallIterations, 5 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1314 SDtfs, 548 SDslu, 3592 SDs, 0 SdLazy, 1830 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 196 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 69 NumberOfFragments, 117 HoareAnnotationTreeSize, 24 FomulaSimplifications, 4889 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 921 NumberOfCodeBlocks, 921 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 897 ConstructedInterpolants, 1 QuantifiedInterpolants, 77783 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 93/253 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...