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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:57:36,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:57:36,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:57:36,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:57:36,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:57:36,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:57:36,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:57:36,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:57:36,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:57:36,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:57:36,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:57:36,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:57:36,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:57:36,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:57:36,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:57:36,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:57:36,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:57:36,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:57:36,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:57:36,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:57:36,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:57:36,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:57:36,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:57:36,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:57:36,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:57:36,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:57:36,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:57:36,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:57:36,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:57:36,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:57:36,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:57:36,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:57:36,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:57:36,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:57:36,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:57:36,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:57:36,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:57:36,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:57:36,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:57:36,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:57:36,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:57:36,609 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-14 23:57:36,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:57:36,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:57:36,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:57:36,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:57:36,625 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:57:36,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:57:36,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:57:36,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:57:36,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:57:36,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:57:36,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:57:36,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:57:36,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:57:36,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:57:36,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:57:36,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:57:36,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:57:36,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:57:36,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:57:36,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:57:36,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:57:36,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:57:36,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:57:36,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:57:36,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:57:36,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:57:36,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:57:36,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:57:36,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:57:36,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:57:36,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:57:36,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:57:36,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:57:36,929 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:57:36,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-14 23:57:37,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f214d00a/786a73cd0e444315aa29a3a233abac15/FLAG0b96a47c2 [2019-10-14 23:57:37,570 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:57:37,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-14 23:57:37,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f214d00a/786a73cd0e444315aa29a3a233abac15/FLAG0b96a47c2 [2019-10-14 23:57:37,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f214d00a/786a73cd0e444315aa29a3a233abac15 [2019-10-14 23:57:37,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:57:37,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:57:37,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:37,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:57:37,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:57:37,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:37" (1/1) ... [2019-10-14 23:57:37,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de72e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:37, skipping insertion in model container [2019-10-14 23:57:37,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:37" (1/1) ... [2019-10-14 23:57:37,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:57:37,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:57:38,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:38,454 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:57:38,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:38,648 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:57:38,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38 WrapperNode [2019-10-14 23:57:38,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:38,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:57:38,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:57:38,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:57:38,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (1/1) ... [2019-10-14 23:57:38,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:57:38,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:57:38,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:57:38,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:57:38,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (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-14 23:57:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:57:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:57:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:57:38,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:57:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:57:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:57:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:57:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:57:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:57:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:57:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:57:40,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:57:40,352 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:57:40,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:40 BoogieIcfgContainer [2019-10-14 23:57:40,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:57:40,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:57:40,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:57:40,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:57:40,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:57:37" (1/3) ... [2019-10-14 23:57:40,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fde19a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:40, skipping insertion in model container [2019-10-14 23:57:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:38" (2/3) ... [2019-10-14 23:57:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fde19a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:40, skipping insertion in model container [2019-10-14 23:57:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:40" (3/3) ... [2019-10-14 23:57:40,364 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-10-14 23:57:40,378 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:57:40,390 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:57:40,401 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:57:40,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:57:40,436 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:57:40,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:57:40,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:57:40,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:57:40,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:57:40,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:57:40,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:57:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:57:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-14 23:57:40,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:40,497 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:40,499 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2010725689, now seen corresponding path program 1 times [2019-10-14 23:57:40,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:40,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645433432] [2019-10-14 23:57:40,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:40,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:40,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:41,010 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-14 23:57:41,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645433432] [2019-10-14 23:57:41,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:41,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:57:41,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346164900] [2019-10-14 23:57:41,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:57:41,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:57:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:57:41,039 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:57:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:42,178 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:57:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:57:42,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-14 23:57:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:42,197 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:57:42,198 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:42,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:57:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:57:42,280 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 131 [2019-10-14 23:57:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:42,282 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:57:42,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:57:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:57:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-14 23:57:42,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:42,288 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:42,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2056186306, now seen corresponding path program 1 times [2019-10-14 23:57:42,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:42,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940788568] [2019-10-14 23:57:42,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:42,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:42,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:42,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940788568] [2019-10-14 23:57:42,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:42,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:42,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353606159] [2019-10-14 23:57:42,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:42,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:42,596 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:57:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:43,274 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:57:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:43,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-14 23:57:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:43,279 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:57:43,280 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:43,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-14 23:57:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:57:43,308 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 139 [2019-10-14 23:57:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:43,309 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:57:43,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:57:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-14 23:57:43,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:43,313 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:43,314 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1041677834, now seen corresponding path program 1 times [2019-10-14 23:57:43,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:43,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302331457] [2019-10-14 23:57:43,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:43,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:43,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:43,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302331457] [2019-10-14 23:57:43,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:43,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:43,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231395657] [2019-10-14 23:57:43,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:43,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:43,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:43,692 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:57:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:44,407 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:57:44,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:44,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-14 23:57:44,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:44,414 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:57:44,414 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:44,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-14 23:57:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:57:44,443 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 145 [2019-10-14 23:57:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:44,443 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:57:44,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:57:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-14 23:57:44,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:44,448 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:44,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:44,449 INFO L82 PathProgramCache]: Analyzing trace with hash -33342687, now seen corresponding path program 1 times [2019-10-14 23:57:44,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:44,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013839795] [2019-10-14 23:57:44,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:44,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:44,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:44,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013839795] [2019-10-14 23:57:44,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:44,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:57:44,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707092238] [2019-10-14 23:57:44,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:57:44,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:57:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:57:44,600 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:57:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:45,452 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:57:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:57:45,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-14 23:57:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:45,458 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:57:45,458 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:57:45,460 INFO L600 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-14 23:57:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:57:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:57:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-14 23:57:45,507 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 153 [2019-10-14 23:57:45,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:45,507 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-14 23:57:45,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:57:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-14 23:57:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:57:45,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:45,513 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:45,514 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1756128357, now seen corresponding path program 1 times [2019-10-14 23:57:45,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:45,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56838657] [2019-10-14 23:57:45,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:45,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:45,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:45,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56838657] [2019-10-14 23:57:45,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:45,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:45,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755722816] [2019-10-14 23:57:45,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:45,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:45,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:45,816 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-14 23:57:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:46,519 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-14 23:57:46,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:46,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-14 23:57:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:46,526 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:57:46,526 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:57:46,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-14 23:57:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:57:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:57:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-14 23:57:46,555 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 155 [2019-10-14 23:57:46,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:46,556 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-14 23:57:46,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-14 23:57:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:57:46,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:46,560 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:46,560 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1935651415, now seen corresponding path program 1 times [2019-10-14 23:57:46,561 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:46,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835073840] [2019-10-14 23:57:46,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:46,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:46,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:46,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835073840] [2019-10-14 23:57:46,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:46,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:46,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296287199] [2019-10-14 23:57:46,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:46,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:46,849 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-14 23:57:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:47,545 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-14 23:57:47,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:47,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-14 23:57:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:47,550 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:57:47,551 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:57:47,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-14 23:57:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:57:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:57:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-14 23:57:47,574 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 157 [2019-10-14 23:57:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:47,574 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-14 23:57:47,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-14 23:57:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-14 23:57:47,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:47,578 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:47,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1918345167, now seen corresponding path program 1 times [2019-10-14 23:57:47,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:47,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804837123] [2019-10-14 23:57:47,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:47,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:47,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:47,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804837123] [2019-10-14 23:57:47,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:47,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:57:47,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879666911] [2019-10-14 23:57:47,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:57:47,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:47,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:57:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:57:47,669 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-14 23:57:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:48,407 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-14 23:57:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:57:48,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-14 23:57:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:48,416 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:57:48,416 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:57:48,419 INFO L600 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-14 23:57:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:57:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:57:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:57:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-14 23:57:48,460 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 161 [2019-10-14 23:57:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:48,460 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-14 23:57:48,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:57:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-14 23:57:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-14 23:57:48,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:48,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:57:48,466 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash 264500657, now seen corresponding path program 1 times [2019-10-14 23:57:48,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:48,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634080834] [2019-10-14 23:57:48,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:48,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:48,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634080834] [2019-10-14 23:57:48,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916462051] [2019-10-14 23:57:48,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:57:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:48,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:57:48,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:57:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:57:48,918 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:57:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:57:49,063 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:57:49,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:57:49,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360458668] [2019-10-14 23:57:49,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:57:49,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:49,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:57:49,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:57:49,067 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 3 states. [2019-10-14 23:57:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:49,776 INFO L93 Difference]: Finished difference Result 3012 states and 4063 transitions. [2019-10-14 23:57:49,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:57:49,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-14 23:57:49,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:49,790 INFO L225 Difference]: With dead ends: 3012 [2019-10-14 23:57:49,790 INFO L226 Difference]: Without dead ends: 1060 [2019-10-14 23:57:49,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 388 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:57:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-14 23:57:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2019-10-14 23:57:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-10-14 23:57:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1379 transitions. [2019-10-14 23:57:49,854 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1379 transitions. Word has length 195 [2019-10-14 23:57:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:49,856 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1379 transitions. [2019-10-14 23:57:49,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:57:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1379 transitions. [2019-10-14 23:57:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-14 23:57:49,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:49,865 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:50,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:57:50,073 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1356768321, now seen corresponding path program 1 times [2019-10-14 23:57:50,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:50,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026468223] [2019-10-14 23:57:50,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:50,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:50,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:50,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026468223] [2019-10-14 23:57:50,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378519952] [2019-10-14 23:57:50,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:57:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:50,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:57:50,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:57:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:50,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:57:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:57:50,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1109644612] [2019-10-14 23:57:50,540 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 199 [2019-10-14 23:57:50,615 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:57:50,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)