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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 19:13:11,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 19:13:11,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 19:13:11,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 19:13:11,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 19:13:11,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 19:13:11,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 19:13:11,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 19:13:11,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 19:13:11,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 19:13:11,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 19:13:11,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 19:13:11,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 19:13:11,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 19:13:11,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 19:13:11,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 19:13:11,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 19:13:11,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 19:13:11,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 19:13:11,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 19:13:11,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 19:13:11,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 19:13:11,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 19:13:11,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 19:13:11,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 19:13:11,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 19:13:11,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 19:13:11,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 19:13:11,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 19:13:11,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 19:13:11,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 19:13:11,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 19:13:11,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 19:13:11,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 19:13:11,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 19:13:11,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 19:13:11,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 19:13:11,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 19:13:11,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 19:13:11,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 19:13:11,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 19:13:11,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 19:13:11,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 19:13:11,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 19:13:11,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 19:13:11,623 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 19:13:11,624 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 19:13:11,624 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 19:13:11,624 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 19:13:11,624 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 19:13:11,625 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 19:13:11,625 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 19:13:11,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 19:13:11,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 19:13:11,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 19:13:11,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 19:13:11,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 19:13:11,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 19:13:11,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 19:13:11,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 19:13:11,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 19:13:11,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 19:13:11,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 19:13:11,628 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 19:13:11,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 19:13:11,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 19:13:11,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 19:13:11,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 19:13:11,629 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 19:13:11,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 19:13:11,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 19:13:11,629 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 19:13:11,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 19:13:11,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 19:13:11,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 19:13:11,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 19:13:11,682 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 19:13:11,683 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2019-10-02 19:13:11,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e57ab87/ab71edc53d9c4676acf1d1a829590f37/FLAG9fac491e9 [2019-10-02 19:13:12,291 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 19:13:12,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label48.c [2019-10-02 19:13:12,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e57ab87/ab71edc53d9c4676acf1d1a829590f37/FLAG9fac491e9 [2019-10-02 19:13:12,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e57ab87/ab71edc53d9c4676acf1d1a829590f37 [2019-10-02 19:13:12,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 19:13:12,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 19:13:12,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 19:13:12,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 19:13:12,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 19:13:12,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:13:12" (1/1) ... [2019-10-02 19:13:12,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313d98cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:12, skipping insertion in model container [2019-10-02 19:13:12,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 07:13:12" (1/1) ... [2019-10-02 19:13:12,554 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 19:13:12,617 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 19:13:13,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:13:13,149 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 19:13:13,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 19:13:13,316 INFO L192 MainTranslator]: Completed translation [2019-10-02 19:13:13,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13 WrapperNode [2019-10-02 19:13:13,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 19:13:13,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 19:13:13,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 19:13:13,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 19:13:13,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (1/1) ... [2019-10-02 19:13:13,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 19:13:13,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 19:13:13,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 19:13:13,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 19:13:13,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (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 19:13:13,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 19:13:13,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 19:13:13,499 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 19:13:13,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 19:13:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 19:13:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 19:13:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 19:13:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 19:13:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 19:13:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 19:13:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 19:13:14,901 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 19:13:14,902 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 19:13:14,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:13:14 BoogieIcfgContainer [2019-10-02 19:13:14,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 19:13:14,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 19:13:14,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 19:13:14,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 19:13:14,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 07:13:12" (1/3) ... [2019-10-02 19:13:14,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ed4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:13:14, skipping insertion in model container [2019-10-02 19:13:14,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 07:13:13" (2/3) ... [2019-10-02 19:13:14,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ed4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 07:13:14, skipping insertion in model container [2019-10-02 19:13:14,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 07:13:14" (3/3) ... [2019-10-02 19:13:14,912 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label48.c [2019-10-02 19:13:14,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 19:13:14,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 19:13:14,950 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 19:13:14,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 19:13:14,980 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 19:13:14,980 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 19:13:14,980 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 19:13:14,982 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 19:13:14,983 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 19:13:14,983 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 19:13:14,983 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 19:13:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-02 19:13:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 19:13:15,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:15,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 19:13:15,032 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 54045006, now seen corresponding path program 1 times [2019-10-02 19:13:15,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:15,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:15,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:15,245 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 19:13:15,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:15,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 19:13:15,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:15,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 19:13:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 19:13:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 19:13:15,273 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-10-02 19:13:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:16,292 INFO L93 Difference]: Finished difference Result 362 states and 555 transitions. [2019-10-02 19:13:16,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 19:13:16,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-02 19:13:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:16,310 INFO L225 Difference]: With dead ends: 362 [2019-10-02 19:13:16,310 INFO L226 Difference]: Without dead ends: 294 [2019-10-02 19:13:16,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:13:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-02 19:13:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-02 19:13:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-02 19:13:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2019-10-02 19:13:16,399 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 13 [2019-10-02 19:13:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:16,400 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2019-10-02 19:13:16,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 19:13:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2019-10-02 19:13:16,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 19:13:16,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:16,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:16,407 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash 58156773, now seen corresponding path program 1 times [2019-10-02 19:13:16,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:16,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:16,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:16,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:16,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:13:16,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:16,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:13:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:13:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:13:16,730 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 6 states. [2019-10-02 19:13:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:17,661 INFO L93 Difference]: Finished difference Result 453 states and 640 transitions. [2019-10-02 19:13:17,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:13:17,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-10-02 19:13:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:17,666 INFO L225 Difference]: With dead ends: 453 [2019-10-02 19:13:17,666 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 19:13:17,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 19:13:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 19:13:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2019-10-02 19:13:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-02 19:13:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 626 transitions. [2019-10-02 19:13:17,700 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 626 transitions. Word has length 86 [2019-10-02 19:13:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:17,701 INFO L475 AbstractCegarLoop]: Abstraction has 445 states and 626 transitions. [2019-10-02 19:13:17,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:13:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 626 transitions. [2019-10-02 19:13:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 19:13:17,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:17,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:17,705 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1907689263, now seen corresponding path program 1 times [2019-10-02 19:13:17,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:17,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:17,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:17,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 19:13:17,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:17,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 19:13:17,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 19:13:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 19:13:17,796 INFO L87 Difference]: Start difference. First operand 445 states and 626 transitions. Second operand 3 states. [2019-10-02 19:13:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:18,446 INFO L93 Difference]: Finished difference Result 880 states and 1152 transitions. [2019-10-02 19:13:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 19:13:18,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-02 19:13:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:18,455 INFO L225 Difference]: With dead ends: 880 [2019-10-02 19:13:18,455 INFO L226 Difference]: Without dead ends: 880 [2019-10-02 19:13:18,456 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:13:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-10-02 19:13:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2019-10-02 19:13:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-10-02 19:13:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1152 transitions. [2019-10-02 19:13:18,507 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1152 transitions. Word has length 92 [2019-10-02 19:13:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:18,507 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1152 transitions. [2019-10-02 19:13:18,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 19:13:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1152 transitions. [2019-10-02 19:13:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 19:13:18,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:18,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:18,513 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1492328462, now seen corresponding path program 1 times [2019-10-02 19:13:18,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:18,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:18,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:18,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:18,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:18,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:13:18,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:18,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:13:18,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:13:18,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:13:18,661 INFO L87 Difference]: Start difference. First operand 880 states and 1152 transitions. Second operand 6 states. [2019-10-02 19:13:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:19,659 INFO L93 Difference]: Finished difference Result 1204 states and 1619 transitions. [2019-10-02 19:13:19,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:13:19,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-10-02 19:13:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:19,678 INFO L225 Difference]: With dead ends: 1204 [2019-10-02 19:13:19,680 INFO L226 Difference]: Without dead ends: 1204 [2019-10-02 19:13:19,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 19:13:19,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-10-02 19:13:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1192. [2019-10-02 19:13:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-02 19:13:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1576 transitions. [2019-10-02 19:13:19,739 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1576 transitions. Word has length 103 [2019-10-02 19:13:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:19,740 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1576 transitions. [2019-10-02 19:13:19,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:13:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1576 transitions. [2019-10-02 19:13:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 19:13:19,746 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:19,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:19,747 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -28083010, now seen corresponding path program 1 times [2019-10-02 19:13:19,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:19,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:19,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:19,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:19,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:13:19,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:19,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:13:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:13:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:13:19,936 INFO L87 Difference]: Start difference. First operand 1192 states and 1576 transitions. Second operand 6 states. [2019-10-02 19:13:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:20,961 INFO L93 Difference]: Finished difference Result 1502 states and 2019 transitions. [2019-10-02 19:13:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:13:20,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-02 19:13:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:20,978 INFO L225 Difference]: With dead ends: 1502 [2019-10-02 19:13:20,978 INFO L226 Difference]: Without dead ends: 1502 [2019-10-02 19:13:20,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 19:13:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-10-02 19:13:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2019-10-02 19:13:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-02 19:13:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1748 transitions. [2019-10-02 19:13:21,043 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1748 transitions. Word has length 125 [2019-10-02 19:13:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:21,044 INFO L475 AbstractCegarLoop]: Abstraction has 1339 states and 1748 transitions. [2019-10-02 19:13:21,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:13:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1748 transitions. [2019-10-02 19:13:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 19:13:21,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:21,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:21,051 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1911741586, now seen corresponding path program 1 times [2019-10-02 19:13:21,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:21,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 19:13:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 19:13:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 19:13:21,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:13:21,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 19:13:21,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 19:13:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 19:13:21,351 INFO L87 Difference]: Start difference. First operand 1339 states and 1748 transitions. Second operand 6 states. [2019-10-02 19:13:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:13:22,267 INFO L93 Difference]: Finished difference Result 1359 states and 1682 transitions. [2019-10-02 19:13:22,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 19:13:22,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 19:13:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:13:22,275 INFO L225 Difference]: With dead ends: 1359 [2019-10-02 19:13:22,275 INFO L226 Difference]: Without dead ends: 1359 [2019-10-02 19:13:22,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 19:13:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-10-02 19:13:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1204. [2019-10-02 19:13:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-02 19:13:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1482 transitions. [2019-10-02 19:13:22,310 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1482 transitions. Word has length 149 [2019-10-02 19:13:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:13:22,310 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1482 transitions. [2019-10-02 19:13:22,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 19:13:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1482 transitions. [2019-10-02 19:13:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 19:13:22,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:13:22,316 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:13:22,316 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:13:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:13:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash -782626831, now seen corresponding path program 1 times [2019-10-02 19:13:22,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:13:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:13:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:13:22,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:13:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:13:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 19:13:22,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 19:13:22,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 19:13:22,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2019-10-02 19:13:22,581 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2019-10-02 19:13:22,637 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 19:13:22,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 19:13:34,808 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 19:14:54,604 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 19:14:54,607 INFO L272 AbstractInterpreter]: Visited 144 different actions 281 times. Merged at 3 different actions 3 times. Never widened. Performed 416 root evaluator evaluations with a maximum evaluation depth of 16. Performed 416 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 19:14:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:14:54,612 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 19:15:37,565 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 72.55% of their original sizes. [2019-10-02 19:15:37,565 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 19:15:37,673 INFO L420 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2019-10-02 19:15:37,673 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 19:15:37,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 19:15:37,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2019-10-02 19:15:37,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:15:37,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 19:15:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 19:15:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 19:15:37,676 INFO L87 Difference]: Start difference. First operand 1204 states and 1482 transitions. Second operand 12 states. [2019-10-02 19:21:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 19:21:40,619 INFO L93 Difference]: Finished difference Result 1514 states and 1801 transitions. [2019-10-02 19:21:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 19:21:40,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-10-02 19:21:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 19:21:40,626 INFO L225 Difference]: With dead ends: 1514 [2019-10-02 19:21:40,626 INFO L226 Difference]: Without dead ends: 1348 [2019-10-02 19:21:40,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-10-02 19:21:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2019-10-02 19:21:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1347. [2019-10-02 19:21:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-10-02 19:21:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1632 transitions. [2019-10-02 19:21:40,660 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1632 transitions. Word has length 228 [2019-10-02 19:21:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 19:21:40,660 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1632 transitions. [2019-10-02 19:21:40,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 19:21:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1632 transitions. [2019-10-02 19:21:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 19:21:40,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 19:21:40,666 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:21:40,666 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 19:21:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:21:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2028110983, now seen corresponding path program 1 times [2019-10-02 19:21:40,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 19:21:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:21:40,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 19:21:40,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 19:21:40,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 19:21:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 19:21:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 19:21:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 19:21:40,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 19:21:40,926 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-10-02 19:21:40,927 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [13], [15], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [805], [809], [811], [816], [817], [818], [820], [821] [2019-10-02 19:21:40,933 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 19:21:40,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 19:22:12,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 19:23:47,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 19:23:47,920 INFO L272 AbstractInterpreter]: Visited 144 different actions 282 times. Merged at 4 different actions 4 times. Never widened. Performed 527 root evaluator evaluations with a maximum evaluation depth of 16. Performed 527 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 19:23:47,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 19:23:47,920 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 19:25:38,294 INFO L227 lantSequenceWeakener]: Weakened 261 states. On average, predicates are now at 72.57% of their original sizes. [2019-10-02 19:25:38,294 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 19:25:38,411 INFO L420 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2019-10-02 19:25:38,411 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 19:25:38,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 19:25:38,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-10-02 19:25:38,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 19:25:38,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 19:25:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 19:25:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 19:25:38,414 INFO L87 Difference]: Start difference. First operand 1347 states and 1632 transitions. Second operand 13 states.