java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:17:52,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:17:52,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:17:52,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:17:52,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:17:52,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:17:52,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:17:52,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:17:52,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:17:52,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:17:52,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:17:52,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:17:52,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:17:52,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:17:52,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:17:52,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:17:52,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:17:52,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:17:52,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:17:52,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:17:52,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:17:52,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:17:52,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:17:52,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:17:52,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:17:52,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:17:52,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:17:52,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:17:52,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:17:52,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:17:52,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:17:52,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:17:52,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:17:52,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:17:52,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:17:52,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:17:52,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:17:52,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:17:52,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:17:52,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:17:52,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:17:52,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:17:52,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:17:52,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:17:52,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:17:52,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:17:52,304 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:17:52,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:17:52,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:17:52,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:17:52,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:17:52,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:17:52,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:17:52,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:17:52,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:17:52,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:17:52,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:17:52,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:17:52,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:17:52,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:17:52,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:17:52,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:17:52,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:17:52,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:17:52,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:17:52,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:17:52,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:17:52,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:17:52,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:17:52,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:17:52,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:17:52,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:17:52,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:17:52,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:17:52,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:17:52,389 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:17:52,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-02 11:17:52,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbce6451/b4305827c80b43fe95102e96dc909ba1/FLAGc35af468d [2019-10-02 11:17:52,880 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:17:52,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-10-02 11:17:52,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbce6451/b4305827c80b43fe95102e96dc909ba1/FLAGc35af468d [2019-10-02 11:17:53,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbce6451/b4305827c80b43fe95102e96dc909ba1 [2019-10-02 11:17:53,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:17:53,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:17:53,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:53,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:17:53,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:17:53,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286d247e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53, skipping insertion in model container [2019-10-02 11:17:53,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,292 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:17:53,322 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:17:53,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:53,544 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:17:53,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:17:53,689 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:17:53,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53 WrapperNode [2019-10-02 11:17:53,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:17:53,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:17:53,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:17:53,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:17:53,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... [2019-10-02 11:17:53,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:17:53,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:17:53,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:17:53,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:17:53,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:17:53,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:17:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:17:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:17:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:17:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:17:53,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:17:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:17:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:17:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:17:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:17:54,194 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:17:54,194 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:17:54,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:54 BoogieIcfgContainer [2019-10-02 11:17:54,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:17:54,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:17:54,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:17:54,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:17:54,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:17:53" (1/3) ... [2019-10-02 11:17:54,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bb76c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:54, skipping insertion in model container [2019-10-02 11:17:54,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:17:53" (2/3) ... [2019-10-02 11:17:54,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77bb76c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:17:54, skipping insertion in model container [2019-10-02 11:17:54,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:17:54" (3/3) ... [2019-10-02 11:17:54,203 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-10-02 11:17:54,213 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:17:54,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-02 11:17:54,239 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-02 11:17:54,270 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:17:54,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:17:54,270 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:17:54,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:17:54,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:17:54,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:17:54,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:17:54,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:17:54,272 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:17:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-02 11:17:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:17:54,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,304 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-10-02 11:17:54,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:54,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:17:54,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:17:54,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:17:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:17:54,502 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-10-02 11:17:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,544 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-10-02 11:17:54,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:17:54,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:17:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,555 INFO L225 Difference]: With dead ends: 93 [2019-10-02 11:17:54,555 INFO L226 Difference]: Without dead ends: 80 [2019-10-02 11:17:54,558 INFO L640 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 [2019-10-02 11:17:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-02 11:17:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-02 11:17:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-02 11:17:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-02 11:17:54,611 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-10-02 11:17:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,613 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-02 11:17:54,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:17:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-02 11:17:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:17:54,614 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,615 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-10-02 11:17:54,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:17:54,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:54,702 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-10-02 11:17:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:54,830 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-10-02 11:17:54,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:54,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:17:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:54,832 INFO L225 Difference]: With dead ends: 80 [2019-10-02 11:17:54,832 INFO L226 Difference]: Without dead ends: 78 [2019-10-02 11:17:54,833 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-02 11:17:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-02 11:17:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-02 11:17:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-10-02 11:17:54,843 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-10-02 11:17:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:54,844 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-10-02 11:17:54,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-10-02 11:17:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:17:54,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:54,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:54,846 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-10-02 11:17:54,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:54,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:54,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:54,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:17:54,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:17:54,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:17:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:17:54,908 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-10-02 11:17:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,019 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-02 11:17:55,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:55,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-02 11:17:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,022 INFO L225 Difference]: With dead ends: 101 [2019-10-02 11:17:55,023 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 11:17:55,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 11:17:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-10-02 11:17:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 11:17:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-02 11:17:55,044 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-10-02 11:17:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,047 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-02 11:17:55,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:17:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-02 11:17:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:17:55,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,050 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-10-02 11:17:55,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:55,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,151 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-10-02 11:17:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,228 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-02 11:17:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:55,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-02 11:17:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,230 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:17:55,230 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 11:17:55,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 11:17:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-02 11:17:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-02 11:17:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-10-02 11:17:55,239 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-10-02 11:17:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,239 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-10-02 11:17:55,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-10-02 11:17:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:17:55,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,242 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-10-02 11:17:55,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:55,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,336 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-10-02 11:17:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,508 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-10-02 11:17:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:55,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-02 11:17:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,510 INFO L225 Difference]: With dead ends: 141 [2019-10-02 11:17:55,511 INFO L226 Difference]: Without dead ends: 139 [2019-10-02 11:17:55,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-02 11:17:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-10-02 11:17:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 11:17:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-02 11:17:55,520 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-10-02 11:17:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,521 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-02 11:17:55,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-02 11:17:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:17:55,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,523 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-10-02 11:17:55,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:55,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,591 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-02 11:17:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,735 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-10-02 11:17:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:55,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-02 11:17:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,737 INFO L225 Difference]: With dead ends: 108 [2019-10-02 11:17:55,737 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 11:17:55,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 11:17:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-10-02 11:17:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-02 11:17:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-10-02 11:17:55,745 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-10-02 11:17:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,746 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-10-02 11:17:55,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-10-02 11:17:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:17:55,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,748 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-10-02 11:17:55,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:55,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:55,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:55,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:55,835 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-10-02 11:17:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:55,954 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-10-02 11:17:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:55,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-02 11:17:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:55,958 INFO L225 Difference]: With dead ends: 121 [2019-10-02 11:17:55,958 INFO L226 Difference]: Without dead ends: 119 [2019-10-02 11:17:55,958 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-02 11:17:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-10-02 11:17:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 11:17:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-02 11:17:55,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-10-02 11:17:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:55,973 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-02 11:17:55,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-02 11:17:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:17:55,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:55,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:55,981 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-10-02 11:17:55,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:55,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:55,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:56,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:56,050 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-10-02 11:17:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,127 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-02 11:17:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:56,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-02 11:17:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,128 INFO L225 Difference]: With dead ends: 77 [2019-10-02 11:17:56,128 INFO L226 Difference]: Without dead ends: 75 [2019-10-02 11:17:56,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-02 11:17:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-02 11:17:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 11:17:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-10-02 11:17:56,134 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-10-02 11:17:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,135 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-10-02 11:17:56,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-10-02 11:17:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:17:56,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,137 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-10-02 11:17:56,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:17:56,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:17:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:17:56,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:17:56,167 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-10-02 11:17:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,210 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-10-02 11:17:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:17:56,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 11:17:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,211 INFO L225 Difference]: With dead ends: 115 [2019-10-02 11:17:56,211 INFO L226 Difference]: Without dead ends: 75 [2019-10-02 11:17:56,214 INFO L640 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 [2019-10-02 11:17:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-02 11:17:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-10-02 11:17:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 11:17:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-10-02 11:17:56,228 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-10-02 11:17:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,229 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-10-02 11:17:56,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:17:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-10-02 11:17:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:17:56,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,233 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-10-02 11:17:56,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:56,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:56,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:56,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:56,311 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-10-02 11:17:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,394 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-10-02 11:17:56,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:56,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-02 11:17:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,395 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:17:56,396 INFO L226 Difference]: Without dead ends: 74 [2019-10-02 11:17:56,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-02 11:17:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-02 11:17:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 11:17:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-10-02 11:17:56,401 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-10-02 11:17:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,401 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-10-02 11:17:56,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-10-02 11:17:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 11:17:56,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,403 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,403 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-10-02 11:17:56,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:17:56,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:56,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:56,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:17:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:56,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:17:56,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:56,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-02 11:17:56,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:17:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:17:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:56,667 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 8 states. [2019-10-02 11:17:56,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,832 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-10-02 11:17:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:56,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-02 11:17:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,833 INFO L225 Difference]: With dead ends: 111 [2019-10-02 11:17:56,833 INFO L226 Difference]: Without dead ends: 109 [2019-10-02 11:17:56,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-02 11:17:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-10-02 11:17:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 11:17:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-10-02 11:17:56,844 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-10-02 11:17:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,844 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-10-02 11:17:56,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:17:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-10-02 11:17:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:17:56,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,848 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-10-02 11:17:56,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:56,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:56,882 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-10-02 11:17:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:56,940 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-02 11:17:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:56,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-02 11:17:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:56,941 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:17:56,941 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:17:56,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:17:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-02 11:17:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 11:17:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-10-02 11:17:56,947 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-10-02 11:17:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:56,947 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-10-02 11:17:56,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-10-02 11:17:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:17:56,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:56,950 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:56,950 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-10-02 11:17:56,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:56,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:56,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:17:57,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:57,016 INFO L224 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) [2019-10-02 11:17:57,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:17:57,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:57,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:17:57,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:57,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-02 11:17:57,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:17:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:17:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:57,123 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2019-10-02 11:17:57,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,217 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-10-02 11:17:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:57,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-02 11:17:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,219 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:17:57,219 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:17:57,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:17:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:17:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-10-02 11:17:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 11:17:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-02 11:17:57,223 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-10-02 11:17:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,224 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-02 11:17:57,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:17:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-02 11:17:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:17:57,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,226 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-10-02 11:17:57,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:57,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:57,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:57,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:57,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:57,281 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-10-02 11:17:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,346 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-10-02 11:17:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:57,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-02 11:17:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,347 INFO L225 Difference]: With dead ends: 63 [2019-10-02 11:17:57,348 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 11:17:57,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 11:17:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-02 11:17:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 11:17:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-02 11:17:57,352 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-10-02 11:17:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,353 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-02 11:17:57,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-02 11:17:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:17:57,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,355 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-10-02 11:17:57,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:57,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:17:57,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:17:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:17:57,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:57,431 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-10-02 11:17:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,537 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-10-02 11:17:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:57,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-10-02 11:17:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,539 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:17:57,539 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 11:17:57,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:17:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 11:17:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-02 11:17:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:17:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-02 11:17:57,544 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-10-02 11:17:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,544 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-02 11:17:57,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:17:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-02 11:17:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:17:57,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,546 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-10-02 11:17:57,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:57,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:57,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:57,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:57,619 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-10-02 11:17:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,730 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-02 11:17:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:57,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-02 11:17:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,732 INFO L225 Difference]: With dead ends: 91 [2019-10-02 11:17:57,732 INFO L226 Difference]: Without dead ends: 89 [2019-10-02 11:17:57,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-02 11:17:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-02 11:17:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-02 11:17:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-10-02 11:17:57,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-10-02 11:17:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,739 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-10-02 11:17:57,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-10-02 11:17:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 11:17:57,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,741 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-10-02 11:17:57,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:57,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:57,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:57,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:57,788 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-10-02 11:17:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,868 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-10-02 11:17:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:57,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-02 11:17:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,869 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:17:57,869 INFO L226 Difference]: Without dead ends: 59 [2019-10-02 11:17:57,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-02 11:17:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-10-02 11:17:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 11:17:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-02 11:17:57,875 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-10-02 11:17:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,876 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-02 11:17:57,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-02 11:17:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:17:57,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,877 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-10-02 11:17:57,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:57,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:57,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:57,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:57,932 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-10-02 11:17:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:57,951 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-10-02 11:17:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:57,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-02 11:17:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:57,953 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:17:57,953 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:17:57,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:17:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-02 11:17:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 11:17:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-02 11:17:57,959 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-10-02 11:17:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:57,959 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-02 11:17:57,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-02 11:17:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 11:17:57,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:57,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:57,961 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-10-02 11:17:57,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:58,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:58,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:58,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:58,009 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-02 11:17:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:58,036 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-10-02 11:17:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:58,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-02 11:17:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:58,038 INFO L225 Difference]: With dead ends: 68 [2019-10-02 11:17:58,038 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 11:17:58,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 11:17:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-02 11:17:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 11:17:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-02 11:17:58,043 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-10-02 11:17:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:58,043 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-02 11:17:58,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-02 11:17:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 11:17:58,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:58,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:58,045 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-10-02 11:17:58,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:58,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:58,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:58,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:58,103 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-02 11:17:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:58,236 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-10-02 11:17:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:17:58,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-02 11:17:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:58,237 INFO L225 Difference]: With dead ends: 90 [2019-10-02 11:17:58,238 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 11:17:58,238 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 11:17:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-10-02 11:17:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 11:17:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-02 11:17:58,243 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-10-02 11:17:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:58,244 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-02 11:17:58,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-02 11:17:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:17:58,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:58,245 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:58,245 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-10-02 11:17:58,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:58,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:58,327 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 11:17:58,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:58,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:17:58,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-02 11:17:58,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:17:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:17:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:58,470 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2019-10-02 11:17:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:58,620 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-10-02 11:17:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:58,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-02 11:17:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:58,621 INFO L225 Difference]: With dead ends: 70 [2019-10-02 11:17:58,621 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:17:58,622 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:17:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:17:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-02 11:17:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:17:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-02 11:17:58,627 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-10-02 11:17:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:58,627 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-02 11:17:58,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:17:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-02 11:17:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:17:58,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:58,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:58,628 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-10-02 11:17:58,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:58,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:58,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:58,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:58,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:58,674 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-02 11:17:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:58,752 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-02 11:17:58,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:17:58,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-02 11:17:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:58,755 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:17:58,755 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 11:17:58,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:17:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 11:17:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-02 11:17:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 11:17:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-02 11:17:58,761 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-10-02 11:17:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:58,761 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-02 11:17:58,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-02 11:17:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 11:17:58,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:58,762 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:58,763 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-10-02 11:17:58,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:58,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:17:58,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:17:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:17:58,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:17:58,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:17:58,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:17:58,810 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-02 11:17:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:58,917 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-10-02 11:17:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:17:58,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-02 11:17:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:58,918 INFO L225 Difference]: With dead ends: 77 [2019-10-02 11:17:58,918 INFO L226 Difference]: Without dead ends: 75 [2019-10-02 11:17:58,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-02 11:17:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-10-02 11:17:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:17:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-02 11:17:58,923 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-10-02 11:17:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:58,923 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-02 11:17:58,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:17:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-02 11:17:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:17:58,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:17:58,924 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:17:58,924 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:17:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:17:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-10-02 11:17:58,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:17:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:17:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:17:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:17:58,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:17:58,964 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:17:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:17:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:17:59,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:17:59,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:17:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:17:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:17:59,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:17:59,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-10-02 11:17:59,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:17:59,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:17:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:17:59,082 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2019-10-02 11:17:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:17:59,133 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-02 11:17:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:17:59,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-02 11:17:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:17:59,134 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:17:59,134 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:17:59,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:17:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:17:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:17:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:17:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:17:59,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-10-02 11:17:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:17:59,136 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:17:59,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:17:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:17:59,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:17:59,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:17:59,797 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-10-02 11:18:00,014 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-10-02 11:18:00,355 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2019-10-02 11:18:00,470 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-10-02 11:18:00,474 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:00,474 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:00,474 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:00,474 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:18:00,475 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 11:18:00,475 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-02 11:18:00,476 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-10-02 11:18:00,477 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse0 (<= 2 main_~main__cp~0)) (.cse3 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (= main_~__VERIFIER_assert__cond~10 1)) (.cse4 (and (not (= main_~__VERIFIER_assert__cond~8 0)) (and (= main_~__VERIFIER_assert__cond~4 1) (and (= main_~__VERIFIER_assert__cond~0 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0))))) (not (= main_~__VERIFIER_assert__cond~7 0)))))) (or (and .cse0 (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~15 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3 (= main_~__VERIFIER_assert__cond~12 1) .cse4) (and (= 0 main_~main__c~0) (or (and .cse0 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse1 .cse2 .cse4))))) [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-10-02 11:18:00,478 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-10-02 11:18:00,479 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-10-02 11:18:00,480 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (= main_~__VERIFIER_assert__cond~16 1)) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-10-02 11:18:00,481 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (and (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3 .cse4) (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 .cse4))))))) (or (and .cse0 (= main_~__VERIFIER_assert__cond~0 1)) (and .cse0 (= (+ main_~main__cp~0 1) main_~main__urilen~0)))) [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-10-02 11:18:00,482 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse0 (and (<= 2 main_~main__cp~0) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)))) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse3 (= main_~__VERIFIER_assert__cond~10 1))) (or (and (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse0 .cse1 .cse2) .cse3 (= 0 main_~main__c~0)) (and (not (= main_~__VERIFIER_assert__cond~15 0)) .cse1 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__c~0) .cse0 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (= main_~__VERIFIER_assert__cond~12 1) .cse3))) [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-10-02 11:18:00,483 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= main_~__VERIFIER_assert__cond~0 0)) [2019-10-02 11:18:00,483 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-10-02 11:18:00,484 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-10-02 11:18:00,485 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-10-02 11:18:00,485 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-10-02 11:18:00,485 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-10-02 11:18:00,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:18:00 BoogieIcfgContainer [2019-10-02 11:18:00,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:18:00,525 INFO L168 Benchmark]: Toolchain (without parser) took 7247.13 ms. Allocated memory was 130.0 MB in the beginning and 348.1 MB in the end (delta: 218.1 MB). Free memory was 85.7 MB in the beginning and 216.9 MB in the end (delta: -131.2 MB). Peak memory consumption was 229.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:00,526 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 130.0 MB. Free memory is still 103.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 11:18:00,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.03 ms. Allocated memory was 130.0 MB in the beginning and 198.2 MB in the end (delta: 68.2 MB). Free memory was 85.7 MB in the beginning and 174.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:00,531 INFO L168 Benchmark]: Boogie Preprocessor took 35.23 ms. Allocated memory is still 198.2 MB. Free memory was 174.0 MB in the beginning and 171.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:00,532 INFO L168 Benchmark]: RCFGBuilder took 468.84 ms. Allocated memory is still 198.2 MB. Free memory was 171.6 MB in the beginning and 144.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:00,535 INFO L168 Benchmark]: TraceAbstraction took 6326.90 ms. Allocated memory was 198.2 MB in the beginning and 348.1 MB in the end (delta: 149.9 MB). Free memory was 144.2 MB in the beginning and 216.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 219.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:00,538 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 130.0 MB. Free memory is still 103.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 412.03 ms. Allocated memory was 130.0 MB in the beginning and 198.2 MB in the end (delta: 68.2 MB). Free memory was 85.7 MB in the beginning and 174.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.23 ms. Allocated memory is still 198.2 MB. Free memory was 174.0 MB in the beginning and 171.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 468.84 ms. Allocated memory is still 198.2 MB. Free memory was 171.6 MB in the beginning and 144.2 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6326.90 ms. Allocated memory was 198.2 MB in the beginning and 348.1 MB in the end (delta: 149.9 MB). Free memory was 144.2 MB in the beginning and 216.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 219.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (0 == main__c && (((((2 <= main__cp && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0) && (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && __VERIFIER_assert__cond == 1) || ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__cp + 1 == main__urilen) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((main__c + 2 <= main__tokenlen && ((((2 <= main__cp && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && ((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) || ((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((2 <= main__cp && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && ((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. SAFE Result, 6.2s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1399 SDtfs, 2515 SDslu, 1868 SDs, 0 SdLazy, 1172 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 18 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 543 HoareAnnotationTreeSize, 9 FomulaSimplifications, 27037 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 23893 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 77293 SizeOfPredicates, 25 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 16/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...