./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 00:39:33,975 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 00:39:33,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 00:39:34,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 00:39:34,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 00:39:34,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 00:39:34,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 00:39:34,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 00:39:34,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 00:39:34,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 00:39:34,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 00:39:34,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 00:39:34,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 00:39:34,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 00:39:34,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 00:39:34,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 00:39:34,027 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 00:39:34,030 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 00:39:34,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 00:39:34,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 00:39:34,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 00:39:34,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 00:39:34,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 00:39:34,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 00:39:34,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 00:39:34,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 00:39:34,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 00:39:34,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 00:39:34,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 00:39:34,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 00:39:34,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 00:39:34,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 00:39:34,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 00:39:34,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 00:39:34,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 00:39:34,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 00:39:34,060 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 00:39:34,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 00:39:34,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 00:39:34,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 00:39:34,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 00:39:34,076 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 00:39:34,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 00:39:34,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 00:39:34,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 00:39:34,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 00:39:34,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 00:39:34,078 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 00:39:34,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 00:39:34,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 00:39:34,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 00:39:34,079 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 00:39:34,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 00:39:34,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 00:39:34,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 00:39:34,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 00:39:34,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 00:39:34,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 00:39:34,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 00:39:34,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 00:39:34,080 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-12-31 00:39:34,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 00:39:34,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 00:39:34,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 00:39:34,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 00:39:34,150 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 00:39:34,150 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:39:34,207 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39108a1d0/40dfc9ff929b473b89a65d734bed823b/FLAG14d65f930 [2018-12-31 00:39:34,723 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 00:39:34,724 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:39:34,737 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39108a1d0/40dfc9ff929b473b89a65d734bed823b/FLAG14d65f930 [2018-12-31 00:39:34,993 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39108a1d0/40dfc9ff929b473b89a65d734bed823b [2018-12-31 00:39:34,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 00:39:35,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 00:39:35,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 00:39:35,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 00:39:35,008 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 00:39:35,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:39:34" (1/1) ... [2018-12-31 00:39:35,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f40f54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35, skipping insertion in model container [2018-12-31 00:39:35,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 12:39:34" (1/1) ... [2018-12-31 00:39:35,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 00:39:35,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 00:39:35,476 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:39:35,485 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 00:39:35,550 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 00:39:35,572 INFO L195 MainTranslator]: Completed translation [2018-12-31 00:39:35,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35 WrapperNode [2018-12-31 00:39:35,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 00:39:35,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 00:39:35,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 00:39:35,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 00:39:35,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 00:39:35,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 00:39:35,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 00:39:35,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 00:39:35,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... [2018-12-31 00:39:35,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 00:39:35,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 00:39:35,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 00:39:35,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 00:39:35,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 00:39:35,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 00:39:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 00:39:37,550 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 00:39:37,550 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-31 00:39:37,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:37 BoogieIcfgContainer [2018-12-31 00:39:37,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 00:39:37,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 00:39:37,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 00:39:37,555 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 00:39:37,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 12:39:34" (1/3) ... [2018-12-31 00:39:37,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfd67c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:39:37, skipping insertion in model container [2018-12-31 00:39:37,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 12:39:35" (2/3) ... [2018-12-31 00:39:37,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfd67c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 12:39:37, skipping insertion in model container [2018-12-31 00:39:37,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:37" (3/3) ... [2018-12-31 00:39:37,559 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-12-31 00:39:37,569 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 00:39:37,578 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 00:39:37,596 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 00:39:37,629 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 00:39:37,630 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 00:39:37,630 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 00:39:37,630 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 00:39:37,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 00:39:37,631 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 00:39:37,631 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 00:39:37,631 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 00:39:37,631 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 00:39:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-12-31 00:39:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 00:39:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:37,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:37,661 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2018-12-31 00:39:37,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:37,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:37,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:37,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:37,807 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-31 00:39:37,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:37,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 00:39:37,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 00:39:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 00:39:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 00:39:37,830 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-12-31 00:39:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:37,864 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2018-12-31 00:39:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 00:39:37,866 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-31 00:39:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:37,883 INFO L225 Difference]: With dead ends: 216 [2018-12-31 00:39:37,883 INFO L226 Difference]: Without dead ends: 100 [2018-12-31 00:39:37,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 00:39:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-31 00:39:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-31 00:39:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-31 00:39:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2018-12-31 00:39:37,938 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2018-12-31 00:39:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:37,939 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2018-12-31 00:39:37,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 00:39:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2018-12-31 00:39:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 00:39:37,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:37,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:37,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2018-12-31 00:39:37,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:37,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:37,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:38,028 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-31 00:39:38,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:38,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:38,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:38,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:38,033 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2018-12-31 00:39:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:38,294 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2018-12-31 00:39:38,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:38,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-31 00:39:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:38,297 INFO L225 Difference]: With dead ends: 201 [2018-12-31 00:39:38,297 INFO L226 Difference]: Without dead ends: 103 [2018-12-31 00:39:38,299 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-31 00:39:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-31 00:39:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-31 00:39:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-31 00:39:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2018-12-31 00:39:38,311 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2018-12-31 00:39:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:38,311 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2018-12-31 00:39:38,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2018-12-31 00:39:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 00:39:38,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:38,314 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:38,314 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2018-12-31 00:39:38,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:38,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:38,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:38,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:38,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:38,850 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 19 [2018-12-31 00:39:39,730 WARN L181 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 39 [2018-12-31 00:39:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:39,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:39,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 00:39:39,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 00:39:39,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 00:39:39,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:39:39,736 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2018-12-31 00:39:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:40,331 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2018-12-31 00:39:40,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:40,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 00:39:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:40,336 INFO L225 Difference]: With dead ends: 205 [2018-12-31 00:39:40,336 INFO L226 Difference]: Without dead ends: 186 [2018-12-31 00:39:40,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:39:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-31 00:39:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-31 00:39:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-31 00:39:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2018-12-31 00:39:40,352 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2018-12-31 00:39:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:40,352 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2018-12-31 00:39:40,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 00:39:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2018-12-31 00:39:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 00:39:40,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:40,353 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:40,354 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2018-12-31 00:39:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:40,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:40,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:40,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:40,432 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2018-12-31 00:39:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:40,511 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2018-12-31 00:39:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:40,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-31 00:39:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:40,513 INFO L225 Difference]: With dead ends: 293 [2018-12-31 00:39:40,513 INFO L226 Difference]: Without dead ends: 124 [2018-12-31 00:39:40,516 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-31 00:39:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-31 00:39:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-31 00:39:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-31 00:39:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2018-12-31 00:39:40,528 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2018-12-31 00:39:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2018-12-31 00:39:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2018-12-31 00:39:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 00:39:40,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:40,530 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:40,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2018-12-31 00:39:40,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:40,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 00:39:40,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:40,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:40,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:40,689 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2018-12-31 00:39:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:40,936 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2018-12-31 00:39:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:40,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-31 00:39:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:40,938 INFO L225 Difference]: With dead ends: 226 [2018-12-31 00:39:40,939 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 00:39:40,939 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-31 00:39:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 00:39:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-31 00:39:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-31 00:39:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2018-12-31 00:39:40,948 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2018-12-31 00:39:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:40,949 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2018-12-31 00:39:40,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2018-12-31 00:39:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 00:39:40,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:40,950 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:40,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2018-12-31 00:39:40,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:40,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:41,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:41,154 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-31 00:39:41,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:41,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:41,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:41,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-31 00:39:41,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 00:39:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 00:39:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:39:41,313 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 4 states. [2018-12-31 00:39:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:41,825 INFO L93 Difference]: Finished difference Result 188 states and 295 transitions. [2018-12-31 00:39:41,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 00:39:41,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-31 00:39:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:41,827 INFO L225 Difference]: With dead ends: 188 [2018-12-31 00:39:41,827 INFO L226 Difference]: Without dead ends: 170 [2018-12-31 00:39:41,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 00:39:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-31 00:39:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-12-31 00:39:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-31 00:39:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 261 transitions. [2018-12-31 00:39:41,837 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 261 transitions. Word has length 23 [2018-12-31 00:39:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:41,837 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 261 transitions. [2018-12-31 00:39:41,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 00:39:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 261 transitions. [2018-12-31 00:39:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 00:39:41,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:41,838 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:41,839 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash 665435966, now seen corresponding path program 1 times [2018-12-31 00:39:41,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:42,059 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:39:42,493 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 38 [2018-12-31 00:39:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:42,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:42,499 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-31 00:39:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:42,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:42,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:42,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-31 00:39:42,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 00:39:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 00:39:42,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:39:42,913 INFO L87 Difference]: Start difference. First operand 168 states and 261 transitions. Second operand 6 states. [2018-12-31 00:39:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:43,712 INFO L93 Difference]: Finished difference Result 226 states and 351 transitions. [2018-12-31 00:39:43,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 00:39:43,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-31 00:39:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:43,715 INFO L225 Difference]: With dead ends: 226 [2018-12-31 00:39:43,715 INFO L226 Difference]: Without dead ends: 222 [2018-12-31 00:39:43,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:39:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-31 00:39:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2018-12-31 00:39:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-31 00:39:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 335 transitions. [2018-12-31 00:39:43,731 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 335 transitions. Word has length 24 [2018-12-31 00:39:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:43,731 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 335 transitions. [2018-12-31 00:39:43,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 00:39:43,731 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2018-12-31 00:39:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 00:39:43,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:43,733 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:43,733 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:43,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:43,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2018-12-31 00:39:43,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:43,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:43,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 00:39:43,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:43,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:43,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:43,814 INFO L87 Difference]: Start difference. First operand 213 states and 335 transitions. Second operand 3 states. [2018-12-31 00:39:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:43,954 INFO L93 Difference]: Finished difference Result 387 states and 604 transitions. [2018-12-31 00:39:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:43,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 00:39:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:43,956 INFO L225 Difference]: With dead ends: 387 [2018-12-31 00:39:43,956 INFO L226 Difference]: Without dead ends: 198 [2018-12-31 00:39:43,957 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-31 00:39:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-31 00:39:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-12-31 00:39:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-31 00:39:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 297 transitions. [2018-12-31 00:39:43,964 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 297 transitions. Word has length 25 [2018-12-31 00:39:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:43,965 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 297 transitions. [2018-12-31 00:39:43,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 297 transitions. [2018-12-31 00:39:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 00:39:43,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:43,966 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:43,966 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2018-12-31 00:39:43,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:43,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:44,369 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2018-12-31 00:39:44,527 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 21 [2018-12-31 00:39:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:44,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:44,530 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-31 00:39:44,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:44,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 00:39:44,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 00:39:44,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-12-31 00:39:44,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 00:39:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 00:39:44,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 00:39:44,784 INFO L87 Difference]: Start difference. First operand 196 states and 297 transitions. Second operand 6 states. [2018-12-31 00:39:45,015 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 00:39:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:45,444 INFO L93 Difference]: Finished difference Result 353 states and 538 transitions. [2018-12-31 00:39:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 00:39:45,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-31 00:39:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:45,451 INFO L225 Difference]: With dead ends: 353 [2018-12-31 00:39:45,451 INFO L226 Difference]: Without dead ends: 337 [2018-12-31 00:39:45,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:39:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-31 00:39:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 308. [2018-12-31 00:39:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-31 00:39:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 467 transitions. [2018-12-31 00:39:45,466 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 467 transitions. Word has length 27 [2018-12-31 00:39:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:45,466 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 467 transitions. [2018-12-31 00:39:45,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 00:39:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 467 transitions. [2018-12-31 00:39:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 00:39:45,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:45,468 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:45,468 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2018-12-31 00:39:45,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:45,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:45,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 00:39:45,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:45,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:45,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:45,557 INFO L87 Difference]: Start difference. First operand 308 states and 467 transitions. Second operand 3 states. [2018-12-31 00:39:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:45,713 INFO L93 Difference]: Finished difference Result 508 states and 774 transitions. [2018-12-31 00:39:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:45,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-31 00:39:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:45,716 INFO L225 Difference]: With dead ends: 508 [2018-12-31 00:39:45,716 INFO L226 Difference]: Without dead ends: 242 [2018-12-31 00:39:45,717 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-31 00:39:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-31 00:39:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-12-31 00:39:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-31 00:39:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 360 transitions. [2018-12-31 00:39:45,726 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 360 transitions. Word has length 33 [2018-12-31 00:39:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:45,727 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 360 transitions. [2018-12-31 00:39:45,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 360 transitions. [2018-12-31 00:39:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 00:39:45,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:45,730 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-31 00:39:45,730 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2082949584, now seen corresponding path program 1 times [2018-12-31 00:39:45,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:45,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:45,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:46,019 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:39:50,443 WARN L181 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2018-12-31 00:39:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:50,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:50,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 00:39:50,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:50,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:50,672 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-31 00:39:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:50,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:50,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 00:39:50,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 00:39:50,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 00:39:50,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:39:50,766 INFO L87 Difference]: Start difference. First operand 240 states and 360 transitions. Second operand 8 states. [2018-12-31 00:39:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:51,277 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2018-12-31 00:39:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 00:39:51,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 00:39:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:51,281 INFO L225 Difference]: With dead ends: 250 [2018-12-31 00:39:51,281 INFO L226 Difference]: Without dead ends: 248 [2018-12-31 00:39:51,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:39:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-31 00:39:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2018-12-31 00:39:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-31 00:39:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2018-12-31 00:39:51,292 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 36 [2018-12-31 00:39:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:51,292 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2018-12-31 00:39:51,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 00:39:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2018-12-31 00:39:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 00:39:51,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:51,296 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-31 00:39:51,297 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2018-12-31 00:39:51,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 00:39:51,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:51,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:51,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:51,394 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2018-12-31 00:39:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:51,669 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2018-12-31 00:39:51,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:51,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-31 00:39:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:51,673 INFO L225 Difference]: With dead ends: 424 [2018-12-31 00:39:51,673 INFO L226 Difference]: Without dead ends: 225 [2018-12-31 00:39:51,675 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-31 00:39:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-12-31 00:39:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-12-31 00:39:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-31 00:39:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2018-12-31 00:39:51,685 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2018-12-31 00:39:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:51,686 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2018-12-31 00:39:51,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2018-12-31 00:39:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 00:39:51,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:51,688 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 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] [2018-12-31 00:39:51,688 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:51,688 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2018-12-31 00:39:51,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:51,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:51,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-31 00:39:51,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 00:39:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 00:39:51,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 00:39:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 00:39:51,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 00:39:51,787 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2018-12-31 00:39:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:52,046 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2018-12-31 00:39:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 00:39:52,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-31 00:39:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:52,048 INFO L225 Difference]: With dead ends: 305 [2018-12-31 00:39:52,049 INFO L226 Difference]: Without dead ends: 143 [2018-12-31 00:39:52,049 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-31 00:39:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-31 00:39:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-12-31 00:39:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-31 00:39:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2018-12-31 00:39:52,056 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2018-12-31 00:39:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:52,056 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2018-12-31 00:39:52,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 00:39:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2018-12-31 00:39:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 00:39:52,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:52,057 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 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] [2018-12-31 00:39:52,057 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2018-12-31 00:39:52,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:52,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:52,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:52,628 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-12-31 00:39:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 00:39:52,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:52,631 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-31 00:39:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:52,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-31 00:39:52,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:39:52,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:39:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:39:52,791 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 9 states. [2018-12-31 00:39:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:52,940 INFO L93 Difference]: Finished difference Result 184 states and 259 transitions. [2018-12-31 00:39:52,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 00:39:52,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-12-31 00:39:52,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:52,943 INFO L225 Difference]: With dead ends: 184 [2018-12-31 00:39:52,944 INFO L226 Difference]: Without dead ends: 180 [2018-12-31 00:39:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:39:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-31 00:39:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-12-31 00:39:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-31 00:39:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2018-12-31 00:39:52,954 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 47 [2018-12-31 00:39:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:52,954 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2018-12-31 00:39:52,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:39:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2018-12-31 00:39:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 00:39:52,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:52,959 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 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, 1, 1] [2018-12-31 00:39:52,959 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:52,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:52,959 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2018-12-31 00:39:52,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:52,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:52,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:52,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:52,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:53,254 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:39:54,085 WARN L181 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 38 [2018-12-31 00:39:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:54,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:54,096 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-31 00:39:54,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:54,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:54,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:54,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-31 00:39:54,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 00:39:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 00:39:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:39:54,346 INFO L87 Difference]: Start difference. First operand 177 states and 250 transitions. Second operand 9 states. [2018-12-31 00:39:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:55,689 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2018-12-31 00:39:55,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 00:39:55,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-31 00:39:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:55,692 INFO L225 Difference]: With dead ends: 180 [2018-12-31 00:39:55,693 INFO L226 Difference]: Without dead ends: 178 [2018-12-31 00:39:55,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 00:39:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-31 00:39:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-31 00:39:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-31 00:39:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2018-12-31 00:39:55,702 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 57 [2018-12-31 00:39:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:55,703 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2018-12-31 00:39:55,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 00:39:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2018-12-31 00:39:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 00:39:55,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:55,706 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-31 00:39:55,706 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2018-12-31 00:39:55,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:55,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,524 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2018-12-31 00:39:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 00:39:56,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:56,537 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-31 00:39:56,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:56,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-12-31 00:39:56,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 00:39:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 00:39:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:39:56,905 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand 14 states. [2018-12-31 00:39:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:57,199 INFO L93 Difference]: Finished difference Result 199 states and 280 transitions. [2018-12-31 00:39:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 00:39:57,201 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-12-31 00:39:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:57,203 INFO L225 Difference]: With dead ends: 199 [2018-12-31 00:39:57,203 INFO L226 Difference]: Without dead ends: 196 [2018-12-31 00:39:57,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:39:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-31 00:39:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-31 00:39:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-31 00:39:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 276 transitions. [2018-12-31 00:39:57,210 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 276 transitions. Word has length 66 [2018-12-31 00:39:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:57,212 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 276 transitions. [2018-12-31 00:39:57,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 00:39:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 276 transitions. [2018-12-31 00:39:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 00:39:57,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:57,213 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-31 00:39:57,213 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1365307632, now seen corresponding path program 1 times [2018-12-31 00:39:57,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:57,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:57,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:57,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-31 00:39:58,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:58,036 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-31 00:39:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:58,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:39:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-31 00:39:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:39:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 00:39:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 00:39:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 00:39:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:39:58,237 INFO L87 Difference]: Start difference. First operand 196 states and 276 transitions. Second operand 8 states. [2018-12-31 00:39:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:39:59,337 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-12-31 00:39:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 00:39:59,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-12-31 00:39:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:39:59,341 INFO L225 Difference]: With dead ends: 221 [2018-12-31 00:39:59,341 INFO L226 Difference]: Without dead ends: 218 [2018-12-31 00:39:59,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 00:39:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-31 00:39:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2018-12-31 00:39:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-31 00:39:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2018-12-31 00:39:59,349 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 75 [2018-12-31 00:39:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:39:59,351 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2018-12-31 00:39:59,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 00:39:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2018-12-31 00:39:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 00:39:59,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:39:59,353 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:39:59,353 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:39:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:39:59,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2018-12-31 00:39:59,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:39:59,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:39:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:59,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:39:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:39:59,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:39:59,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:39:59,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:39:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:39:59,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:00,318 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:00,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:00,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-12-31 00:40:00,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 00:40:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 00:40:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-31 00:40:00,432 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand 11 states. [2018-12-31 00:40:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:00,863 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-12-31 00:40:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 00:40:00,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-12-31 00:40:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:00,866 INFO L225 Difference]: With dead ends: 217 [2018-12-31 00:40:00,866 INFO L226 Difference]: Without dead ends: 215 [2018-12-31 00:40:00,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-31 00:40:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-31 00:40:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-31 00:40:00,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-31 00:40:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 302 transitions. [2018-12-31 00:40:00,877 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 302 transitions. Word has length 78 [2018-12-31 00:40:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:00,877 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 302 transitions. [2018-12-31 00:40:00,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 00:40:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 302 transitions. [2018-12-31 00:40:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-31 00:40:00,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:00,880 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:00,881 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash 595683003, now seen corresponding path program 1 times [2018-12-31 00:40:00,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:00,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:00,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:40:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:01,917 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-31 00:40:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-31 00:40:01,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:01,937 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:01,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:40:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:02,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:02,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:02,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-12-31 00:40:02,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 00:40:02,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 00:40:02,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:02,593 INFO L87 Difference]: Start difference. First operand 215 states and 302 transitions. Second operand 15 states. [2018-12-31 00:40:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:02,766 INFO L93 Difference]: Finished difference Result 258 states and 362 transitions. [2018-12-31 00:40:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 00:40:02,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-12-31 00:40:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:02,770 INFO L225 Difference]: With dead ends: 258 [2018-12-31 00:40:02,770 INFO L226 Difference]: Without dead ends: 254 [2018-12-31 00:40:02,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-31 00:40:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-12-31 00:40:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-31 00:40:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 353 transitions. [2018-12-31 00:40:02,781 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 353 transitions. Word has length 89 [2018-12-31 00:40:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:02,781 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 353 transitions. [2018-12-31 00:40:02,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 00:40:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 353 transitions. [2018-12-31 00:40:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 00:40:02,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:02,785 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:02,785 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1136679040, now seen corresponding path program 2 times [2018-12-31 00:40:02,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:02,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:02,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 00:40:02,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:03,151 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:04,268 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 39 [2018-12-31 00:40:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:04,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:04,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:40:04,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:40:04,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:04,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:05,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:05,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 15 [2018-12-31 00:40:05,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 00:40:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 00:40:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:05,172 INFO L87 Difference]: Start difference. First operand 251 states and 353 transitions. Second operand 15 states. [2018-12-31 00:40:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:05,780 INFO L93 Difference]: Finished difference Result 254 states and 356 transitions. [2018-12-31 00:40:05,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 00:40:05,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-12-31 00:40:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:05,784 INFO L225 Difference]: With dead ends: 254 [2018-12-31 00:40:05,784 INFO L226 Difference]: Without dead ends: 252 [2018-12-31 00:40:05,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-12-31 00:40:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-12-31 00:40:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-31 00:40:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 354 transitions. [2018-12-31 00:40:05,795 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 354 transitions. Word has length 99 [2018-12-31 00:40:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:05,796 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 354 transitions. [2018-12-31 00:40:05,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 00:40:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 354 transitions. [2018-12-31 00:40:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-31 00:40:05,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:05,800 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:05,800 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 366250712, now seen corresponding path program 2 times [2018-12-31 00:40:05,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:05,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:40:05,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:06,148 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:06,328 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:06,785 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2018-12-31 00:40:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:06,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:06,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:06,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:40:06,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:40:06,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:06,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:07,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-12-31 00:40:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 00:40:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 00:40:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:40:07,327 INFO L87 Difference]: Start difference. First operand 252 states and 354 transitions. Second operand 14 states. [2018-12-31 00:40:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:07,631 INFO L93 Difference]: Finished difference Result 273 states and 383 transitions. [2018-12-31 00:40:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 00:40:07,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 108 [2018-12-31 00:40:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:07,635 INFO L225 Difference]: With dead ends: 273 [2018-12-31 00:40:07,635 INFO L226 Difference]: Without dead ends: 270 [2018-12-31 00:40:07,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-31 00:40:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-31 00:40:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-12-31 00:40:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-31 00:40:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2018-12-31 00:40:07,645 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 108 [2018-12-31 00:40:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:07,646 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2018-12-31 00:40:07,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 00:40:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2018-12-31 00:40:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 00:40:07,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:07,650 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:07,650 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash -23324669, now seen corresponding path program 2 times [2018-12-31 00:40:07,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:07,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:07,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:40:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 00:40:08,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:08,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:40:08,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:40:08,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:08,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 00:40:08,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:08,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-31 00:40:08,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 00:40:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 00:40:08,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:40:08,294 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand 10 states. [2018-12-31 00:40:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:08,524 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-12-31 00:40:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 00:40:08,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-12-31 00:40:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:08,530 INFO L225 Difference]: With dead ends: 295 [2018-12-31 00:40:08,536 INFO L226 Difference]: Without dead ends: 292 [2018-12-31 00:40:08,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 00:40:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-31 00:40:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2018-12-31 00:40:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-31 00:40:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2018-12-31 00:40:08,549 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 117 [2018-12-31 00:40:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:08,549 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2018-12-31 00:40:08,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 00:40:08,549 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-12-31 00:40:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 00:40:08,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:08,553 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:08,555 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:08,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:08,555 INFO L82 PathProgramCache]: Analyzing trace with hash -599032214, now seen corresponding path program 2 times [2018-12-31 00:40:08,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:08,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:08,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:08,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:40:08,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:08,903 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:09,048 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:09,235 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 00:40:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:09,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:09,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:40:09,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:40:09,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:09,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:10,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-12-31 00:40:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 00:40:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 00:40:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:10,045 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand 15 states. [2018-12-31 00:40:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:10,298 INFO L93 Difference]: Finished difference Result 291 states and 407 transitions. [2018-12-31 00:40:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 00:40:10,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 120 [2018-12-31 00:40:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:10,302 INFO L225 Difference]: With dead ends: 291 [2018-12-31 00:40:10,303 INFO L226 Difference]: Without dead ends: 289 [2018-12-31 00:40:10,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-12-31 00:40:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-31 00:40:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-12-31 00:40:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-31 00:40:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 405 transitions. [2018-12-31 00:40:10,313 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 405 transitions. Word has length 120 [2018-12-31 00:40:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:10,314 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 405 transitions. [2018-12-31 00:40:10,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 00:40:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2018-12-31 00:40:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-31 00:40:10,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:10,318 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:10,318 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1532381806, now seen corresponding path program 2 times [2018-12-31 00:40:10,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:10,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:10,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:40:10,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 00:40:10,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:10,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:10,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 00:40:10,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 00:40:10,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:10,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:11,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:11,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-12-31 00:40:11,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 00:40:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 00:40:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-31 00:40:11,538 INFO L87 Difference]: Start difference. First operand 289 states and 405 transitions. Second operand 21 states. [2018-12-31 00:40:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:11,929 INFO L93 Difference]: Finished difference Result 332 states and 465 transitions. [2018-12-31 00:40:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 00:40:11,931 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 131 [2018-12-31 00:40:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:11,934 INFO L225 Difference]: With dead ends: 332 [2018-12-31 00:40:11,934 INFO L226 Difference]: Without dead ends: 328 [2018-12-31 00:40:11,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-31 00:40:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-31 00:40:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2018-12-31 00:40:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-31 00:40:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 456 transitions. [2018-12-31 00:40:11,945 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 456 transitions. Word has length 131 [2018-12-31 00:40:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:11,945 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 456 transitions. [2018-12-31 00:40:11,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 00:40:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 456 transitions. [2018-12-31 00:40:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-31 00:40:11,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 00:40:11,949 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 00:40:11,949 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 00:40:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 00:40:11,949 INFO L82 PathProgramCache]: Analyzing trace with hash 561891187, now seen corresponding path program 3 times [2018-12-31 00:40:11,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 00:40:11,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 00:40:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:11,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 00:40:11,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 00:40:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 00:40:12,333 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 00:40:15,067 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 183 DAG size of output: 40 [2018-12-31 00:40:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 00:40:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 00:40:15,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 00:40:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 00:40:15,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 00:40:15,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 00:40:15,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 00:40:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-31 00:40:15,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 00:40:15,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2018-12-31 00:40:15,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 00:40:15,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 00:40:15,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-12-31 00:40:15,956 INFO L87 Difference]: Start difference. First operand 325 states and 456 transitions. Second operand 21 states. [2018-12-31 00:40:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 00:40:17,088 INFO L93 Difference]: Finished difference Result 334 states and 466 transitions. [2018-12-31 00:40:17,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-31 00:40:17,090 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 141 [2018-12-31 00:40:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 00:40:17,091 INFO L225 Difference]: With dead ends: 334 [2018-12-31 00:40:17,091 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 00:40:17,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2018-12-31 00:40:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 00:40:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 00:40:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 00:40:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 00:40:17,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2018-12-31 00:40:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 00:40:17,093 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 00:40:17,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 00:40:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 00:40:17,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 00:40:17,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 00:40:17,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 00:40:17,594 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 48 [2018-12-31 00:40:17,694 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-12-31 00:40:17,694 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-12-31 00:40:17,695 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-12-31 00:40:17,696 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-12-31 00:40:17,697 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L451 ceAbstractionStarter]: At program point L14(lines 14 566) the Hoare annotation is: true [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-12-31 00:40:17,698 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L444 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-12-31 00:40:17,699 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L444 ceAbstractionStarter]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~this_buffer_empty~0 4294967296) 1))) (.cse1 (<= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 (exists ((v_prenex_29 Int)) (let ((.cse2 (mod v_prenex_29 2))) (and (= 0 .cse2) (= .cse2 (mod ULTIMATE.start_main_~this_expect~0 2))))) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse1))) [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-12-31 00:40:17,700 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-12-31 00:40:17,701 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L444 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~this_buffer_empty~0 4294967296) 1))) (.cse2 (<= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse7 (exists ((v_prenex_29 Int)) (let ((.cse9 (mod v_prenex_29 2))) (and (= 0 .cse9) (= .cse9 (mod ULTIMATE.start_main_~this_expect~0 2)))))) (.cse5 (<= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse6 (<= 1 ULTIMATE.start_main_~this_buffer_empty~0)) (.cse1 (exists ((v_prenex_29 Int)) (let ((.cse8 (mod v_prenex_29 2))) (and (= (mod (+ ULTIMATE.start_main_~this_expect~0 1) 2) .cse8) (= 0 .cse8))))) (.cse3 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse4 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (= ULTIMATE.start_main_~q~0 1) .cse5 .cse6 .cse3 .cse4) .cse7) (and (<= 0 ULTIMATE.start_main_~this_expect~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0) .cse2) (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse6 .cse1 .cse3 .cse4))) [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-12-31 00:40:17,702 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-12-31 00:40:17,703 INFO L448 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-12-31 00:40:17,704 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-12-31 00:40:17,705 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-12-31 00:40:17,705 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-12-31 00:40:17,705 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-12-31 00:40:17,705 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-12-31 00:40:17,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 12:40:17 BoogieIcfgContainer [2018-12-31 00:40:17,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 00:40:17,734 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 00:40:17,734 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 00:40:17,734 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 00:40:17,734 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 12:39:37" (3/4) ... [2018-12-31 00:40:17,738 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 00:40:17,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 00:40:17,758 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 00:40:17,803 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) [2018-12-31 00:40:17,816 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 00:40:17,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 00:40:17,817 INFO L168 Benchmark]: Toolchain (without parser) took 42819.17 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -262.4 MB). Peak memory consumption was 179.0 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,818 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 00:40:17,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,821 INFO L168 Benchmark]: Boogie Preprocessor took 84.72 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,823 INFO L168 Benchmark]: RCFGBuilder took 1733.64 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,823 INFO L168 Benchmark]: TraceAbstraction took 40181.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.6 MB). Peak memory consumption was 146.5 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,825 INFO L168 Benchmark]: Witness Printer took 82.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-31 00:40:17,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 572.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.72 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1733.64 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40181.14 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.6 MB). Peak memory consumption was 146.5 MB. Max. memory is 11.5 GB. * Witness Printer took 82.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-12-31 00:40:17,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,854 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] Derived loop invariant: ((((((((q == 3 && 0 < this_buffer_empty / 4294967296 + 1) && (\exists v_prenex_29 : int :: (this_expect + 1) % 2 == v_prenex_29 % 2 && 0 == v_prenex_29 % 2)) && this_buffer_empty <= 0) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((((q == 1 && this_buffer_empty <= 1) && 1 <= this_buffer_empty) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2))) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0)) || (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((((this_buffer_empty <= 1 && q == 4) && 1 <= this_buffer_empty) && (\exists v_prenex_29 : int :: (this_expect + 1) % 2 == v_prenex_29 % 2 && 0 == v_prenex_29 % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant [2018-12-31 00:40:17,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2018-12-31 00:40:17,861 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] Derived loop invariant: (((((5 <= q && 0 < this_buffer_empty / 4294967296 + 1) && this_buffer_empty <= 0) && (\exists v_prenex_29 : int :: 0 == v_prenex_29 % 2 && v_prenex_29 % 2 == this_expect % 2)) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((0 <= this_expect && 0 < this_buffer_empty / 4294967296 + 1) && this_expect <= 0) && q == 0) && this_buffer_empty <= 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. SAFE Result, 40.0s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4759 SDtfs, 3506 SDslu, 25812 SDs, 0 SdLazy, 3286 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1424 GetRequests, 1219 SyntacticMatches, 25 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 90 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 36 NumberOfFragments, 221 HoareAnnotationTreeSize, 4 FomulaSimplifications, 697 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 912 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2647 ConstructedInterpolants, 42 QuantifiedInterpolants, 2472456 SizeOfPredicates, 59 NumberOfNonLiveVariables, 7629 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1030/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...