java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label22_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 17:20:59,542 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 17:20:59,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 17:20:59,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 17:20:59,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 17:20:59,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 17:20:59,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 17:20:59,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 17:20:59,567 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 17:20:59,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 17:20:59,569 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 17:20:59,569 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 17:20:59,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 17:20:59,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 17:20:59,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 17:20:59,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 17:20:59,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 17:20:59,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 17:20:59,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 17:20:59,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 17:20:59,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 17:20:59,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 17:20:59,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 17:20:59,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 17:20:59,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 17:20:59,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 17:20:59,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 17:20:59,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 17:20:59,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 17:20:59,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 17:20:59,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 17:20:59,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 17:20:59,602 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 17:20:59,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 17:20:59,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 17:20:59,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 17:20:59,606 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 17:20:59,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 17:20:59,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 17:20:59,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 17:20:59,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 17:20:59,634 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 17:20:59,634 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 17:20:59,634 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 17:20:59,635 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 17:20:59,635 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 17:20:59,635 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 17:20:59,635 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 17:20:59,635 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 17:20:59,636 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 17:20:59,636 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 17:20:59,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 17:20:59,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 17:20:59,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 17:20:59,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 17:20:59,638 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 17:20:59,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 17:20:59,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 17:20:59,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 17:20:59,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 17:20:59,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 17:20:59,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 17:20:59,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:20:59,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 17:20:59,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 17:20:59,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 17:20:59,642 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 17:20:59,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 17:20:59,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 17:20:59,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 17:20:59,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 17:20:59,712 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 17:20:59,713 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label22_true-unreach-call.c [2018-11-12 17:20:59,773 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c3296495/ac6e6b259edc4f599967ef08c4c6d308/FLAG898d2177d [2018-11-12 17:21:00,464 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 17:21:00,467 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label22_true-unreach-call.c [2018-11-12 17:21:00,489 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c3296495/ac6e6b259edc4f599967ef08c4c6d308/FLAG898d2177d [2018-11-12 17:21:00,503 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c3296495/ac6e6b259edc4f599967ef08c4c6d308 [2018-11-12 17:21:00,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 17:21:00,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 17:21:00,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 17:21:00,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 17:21:00,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 17:21:00,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:21:00" (1/1) ... [2018-11-12 17:21:00,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2da8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:00, skipping insertion in model container [2018-11-12 17:21:00,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:21:00" (1/1) ... [2018-11-12 17:21:00,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 17:21:00,624 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 17:21:01,420 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:21:01,427 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 17:21:01,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 17:21:01,777 INFO L193 MainTranslator]: Completed translation [2018-11-12 17:21:01,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01 WrapperNode [2018-11-12 17:21:01,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 17:21:01,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 17:21:01,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 17:21:01,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 17:21:01,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:01,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:01,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 17:21:01,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 17:21:01,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 17:21:01,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 17:21:02,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... [2018-11-12 17:21:02,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 17:21:02,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 17:21:02,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 17:21:02,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 17:21:02,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 17:21:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 17:21:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 17:21:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 17:21:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 17:21:02,204 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 17:21:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 17:21:02,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 17:21:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 17:21:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 17:21:07,085 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 17:21:07,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:21:07 BoogieIcfgContainer [2018-11-12 17:21:07,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 17:21:07,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 17:21:07,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 17:21:07,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 17:21:07,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:21:00" (1/3) ... [2018-11-12 17:21:07,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ad69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:21:07, skipping insertion in model container [2018-11-12 17:21:07,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:21:01" (2/3) ... [2018-11-12 17:21:07,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98ad69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:21:07, skipping insertion in model container [2018-11-12 17:21:07,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:21:07" (3/3) ... [2018-11-12 17:21:07,095 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label22_true-unreach-call.c [2018-11-12 17:21:07,105 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 17:21:07,117 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 17:21:07,136 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 17:21:07,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 17:21:07,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 17:21:07,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 17:21:07,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 17:21:07,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 17:21:07,186 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 17:21:07,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 17:21:07,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 17:21:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-12 17:21:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 17:21:07,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:07,241 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:07,245 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:07,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1705983263, now seen corresponding path program 1 times [2018-11-12 17:21:07,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:07,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:07,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:07,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:08,184 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 17:21:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:08,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:21:08,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:08,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:21:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:21:08,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:21:08,456 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2018-11-12 17:21:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:10,778 INFO L93 Difference]: Finished difference Result 838 states and 1479 transitions. [2018-11-12 17:21:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:21:10,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-11-12 17:21:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:10,807 INFO L225 Difference]: With dead ends: 838 [2018-11-12 17:21:10,807 INFO L226 Difference]: Without dead ends: 524 [2018-11-12 17:21:10,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:21:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-11-12 17:21:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2018-11-12 17:21:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-11-12 17:21:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 890 transitions. [2018-11-12 17:21:10,920 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 890 transitions. Word has length 174 [2018-11-12 17:21:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:10,923 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 890 transitions. [2018-11-12 17:21:10,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:21:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 890 transitions. [2018-11-12 17:21:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-12 17:21:10,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:10,933 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:10,934 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:10,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 458519048, now seen corresponding path program 1 times [2018-11-12 17:21:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:10,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:11,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:11,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 17:21:11,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:11,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 17:21:11,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 17:21:11,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 17:21:11,286 INFO L87 Difference]: Start difference. First operand 522 states and 890 transitions. Second operand 6 states. [2018-11-12 17:21:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:14,654 INFO L93 Difference]: Finished difference Result 1581 states and 2759 transitions. [2018-11-12 17:21:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 17:21:14,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-11-12 17:21:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:14,678 INFO L225 Difference]: With dead ends: 1581 [2018-11-12 17:21:14,679 INFO L226 Difference]: Without dead ends: 1065 [2018-11-12 17:21:14,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 17:21:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-11-12 17:21:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1023. [2018-11-12 17:21:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-12 17:21:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1733 transitions. [2018-11-12 17:21:14,755 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1733 transitions. Word has length 184 [2018-11-12 17:21:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:14,756 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1733 transitions. [2018-11-12 17:21:14,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 17:21:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1733 transitions. [2018-11-12 17:21:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-12 17:21:14,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:14,765 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:14,765 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:14,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 12780901, now seen corresponding path program 1 times [2018-11-12 17:21:14,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:14,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:14,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:21:15,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:15,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:21:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:21:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:21:15,119 INFO L87 Difference]: Start difference. First operand 1023 states and 1733 transitions. Second operand 3 states. [2018-11-12 17:21:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:17,789 INFO L93 Difference]: Finished difference Result 2887 states and 5063 transitions. [2018-11-12 17:21:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:21:17,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-11-12 17:21:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:17,815 INFO L225 Difference]: With dead ends: 2887 [2018-11-12 17:21:17,815 INFO L226 Difference]: Without dead ends: 1870 [2018-11-12 17:21:17,820 INFO L604 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 [2018-11-12 17:21:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2018-11-12 17:21:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1865. [2018-11-12 17:21:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1865 states. [2018-11-12 17:21:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 3055 transitions. [2018-11-12 17:21:17,899 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 3055 transitions. Word has length 187 [2018-11-12 17:21:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:17,900 INFO L480 AbstractCegarLoop]: Abstraction has 1865 states and 3055 transitions. [2018-11-12 17:21:17,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:21:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3055 transitions. [2018-11-12 17:21:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-12 17:21:17,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:17,909 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:17,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1985831946, now seen corresponding path program 1 times [2018-11-12 17:21:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:17,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:18,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:18,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 17:21:18,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:18,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:21:18,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:21:18,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 17:21:18,232 INFO L87 Difference]: Start difference. First operand 1865 states and 3055 transitions. Second operand 3 states. [2018-11-12 17:21:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:19,723 INFO L93 Difference]: Finished difference Result 5422 states and 9195 transitions. [2018-11-12 17:21:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:21:19,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-11-12 17:21:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:19,752 INFO L225 Difference]: With dead ends: 5422 [2018-11-12 17:21:19,752 INFO L226 Difference]: Without dead ends: 3563 [2018-11-12 17:21:19,761 INFO L604 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 [2018-11-12 17:21:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-11-12 17:21:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3541. [2018-11-12 17:21:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2018-11-12 17:21:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5808 transitions. [2018-11-12 17:21:19,880 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5808 transitions. Word has length 207 [2018-11-12 17:21:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 3541 states and 5808 transitions. [2018-11-12 17:21:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:21:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5808 transitions. [2018-11-12 17:21:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-12 17:21:19,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:19,898 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:19,899 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:19,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1023448885, now seen corresponding path program 1 times [2018-11-12 17:21:19,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:19,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:19,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:19,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:20,261 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-12 17:21:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:20,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 17:21:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-12 17:21:20,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:20,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 17:21:20,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 17:21:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:21:20,958 INFO L87 Difference]: Start difference. First operand 3541 states and 5808 transitions. Second operand 7 states. [2018-11-12 17:21:21,176 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:21:21,383 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 17:21:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:21:25,484 INFO L93 Difference]: Finished difference Result 15784 states and 30060 transitions. [2018-11-12 17:21:25,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 17:21:25,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2018-11-12 17:21:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:21:25,593 INFO L225 Difference]: With dead ends: 15784 [2018-11-12 17:21:25,593 INFO L226 Difference]: Without dead ends: 12249 [2018-11-12 17:21:25,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-12 17:21:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12249 states. [2018-11-12 17:21:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12249 to 11635. [2018-11-12 17:21:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11635 states. [2018-11-12 17:21:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11635 states to 11635 states and 19720 transitions. [2018-11-12 17:21:26,159 INFO L78 Accepts]: Start accepts. Automaton has 11635 states and 19720 transitions. Word has length 252 [2018-11-12 17:21:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:21:26,160 INFO L480 AbstractCegarLoop]: Abstraction has 11635 states and 19720 transitions. [2018-11-12 17:21:26,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 17:21:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11635 states and 19720 transitions. [2018-11-12 17:21:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-12 17:21:26,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:21:26,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:21:26,237 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:21:26,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:26,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1457202219, now seen corresponding path program 1 times [2018-11-12 17:21:26,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:21:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:21:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:21:26,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:21:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:21:26,541 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-12 17:21:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 98 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:21:26,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:21:26,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:21:26,831 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-11-12 17:21:26,835 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [36], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [315], [318], [322], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [853], [855], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:21:26,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:21:26,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:21:30,126 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:21:30,128 INFO L272 AbstractInterpreter]: Visited 178 different actions 350 times. Merged at 5 different actions 5 times. Never widened. Performed 6722 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:21:30,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:21:30,160 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:21:32,265 INFO L227 lantSequenceWeakener]: Weakened 262 states. On average, predicates are now at 71.51% of their original sizes. [2018-11-12 17:21:32,266 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:21:33,185 INFO L415 sIntCurrentIteration]: We unified 266 AI predicates to 266 [2018-11-12 17:21:33,185 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:21:33,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:21:33,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-12 17:21:33,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:21:33,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 17:21:33,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 17:21:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-12 17:21:33,188 INFO L87 Difference]: Start difference. First operand 11635 states and 19720 transitions. Second operand 15 states. [2018-11-12 17:22:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:22:18,980 INFO L93 Difference]: Finished difference Result 24532 states and 41099 transitions. [2018-11-12 17:22:18,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 17:22:18,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 267 [2018-11-12 17:22:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:22:19,039 INFO L225 Difference]: With dead ends: 24532 [2018-11-12 17:22:19,039 INFO L226 Difference]: Without dead ends: 12903 [2018-11-12 17:22:19,089 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 270 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-11-12 17:22:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12903 states. [2018-11-12 17:22:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12903 to 12863. [2018-11-12 17:22:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12863 states. [2018-11-12 17:22:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12863 states to 12863 states and 20564 transitions. [2018-11-12 17:22:19,485 INFO L78 Accepts]: Start accepts. Automaton has 12863 states and 20564 transitions. Word has length 267 [2018-11-12 17:22:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:22:19,485 INFO L480 AbstractCegarLoop]: Abstraction has 12863 states and 20564 transitions. [2018-11-12 17:22:19,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 17:22:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 12863 states and 20564 transitions. [2018-11-12 17:22:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-12 17:22:19,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:22:19,546 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:22:19,547 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:22:19,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:22:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 86729562, now seen corresponding path program 1 times [2018-11-12 17:22:19,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:22:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:22:19,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:22:19,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:22:19,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:22:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:22:20,181 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:22:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 17:22:20,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:22:20,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:22:20,413 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 275 with the following transitions: [2018-11-12 17:22:20,414 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [315], [318], [322], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [853], [855], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:22:20,428 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:22:20,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:22:24,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:22:24,302 INFO L272 AbstractInterpreter]: Visited 181 different actions 535 times. Merged at 7 different actions 18 times. Never widened. Performed 15359 root evaluator evaluations with a maximum evaluation depth of 6. Performed 15359 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-12 17:22:24,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:22:24,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:22:24,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:22:24,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:22:24,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:22:24,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:22:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:22:24,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:22:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-12 17:22:24,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:22:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-12 17:22:25,387 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:22:25,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-11-12 17:22:25,388 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:22:25,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 17:22:25,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 17:22:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:22:25,389 INFO L87 Difference]: Start difference. First operand 12863 states and 20564 transitions. Second operand 3 states. [2018-11-12 17:22:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:22:27,654 INFO L93 Difference]: Finished difference Result 35702 states and 59014 transitions. [2018-11-12 17:22:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 17:22:27,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2018-11-12 17:22:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:22:27,771 INFO L225 Difference]: With dead ends: 35702 [2018-11-12 17:22:27,772 INFO L226 Difference]: Without dead ends: 23053 [2018-11-12 17:22:27,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 546 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 17:22:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23053 states. [2018-11-12 17:22:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23053 to 22761. [2018-11-12 17:22:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22761 states. [2018-11-12 17:22:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22761 states to 22761 states and 35465 transitions. [2018-11-12 17:22:28,375 INFO L78 Accepts]: Start accepts. Automaton has 22761 states and 35465 transitions. Word has length 274 [2018-11-12 17:22:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:22:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 22761 states and 35465 transitions. [2018-11-12 17:22:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 17:22:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22761 states and 35465 transitions. [2018-11-12 17:22:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-12 17:22:28,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:22:28,437 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:22:28,437 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:22:28,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:22:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1188279711, now seen corresponding path program 1 times [2018-11-12 17:22:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:22:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:22:28,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:22:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:22:28,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:22:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:22:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 17:22:29,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:22:29,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:22:29,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2018-11-12 17:22:29,052 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [115], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [853], [855], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:22:29,060 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:22:29,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:22:31,477 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:22:31,478 INFO L272 AbstractInterpreter]: Visited 179 different actions 354 times. Merged at 5 different actions 7 times. Never widened. Performed 12163 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12163 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:22:31,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:22:31,491 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:22:33,754 INFO L227 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 72.43% of their original sizes. [2018-11-12 17:22:33,754 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:22:38,011 INFO L415 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2018-11-12 17:22:38,011 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:22:38,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:22:38,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2018-11-12 17:22:38,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:22:38,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 17:22:38,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 17:22:38,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-11-12 17:22:38,013 INFO L87 Difference]: Start difference. First operand 22761 states and 35465 transitions. Second operand 23 states. [2018-11-12 17:23:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:23:39,529 INFO L93 Difference]: Finished difference Result 46987 states and 73214 transitions. [2018-11-12 17:23:39,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 17:23:39,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 298 [2018-11-12 17:23:39,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:23:39,624 INFO L225 Difference]: With dead ends: 46987 [2018-11-12 17:23:39,624 INFO L226 Difference]: Without dead ends: 24440 [2018-11-12 17:23:39,664 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 309 GetRequests, 243 SyntacticMatches, 33 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=256, Invalid=934, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 17:23:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24440 states. [2018-11-12 17:23:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24440 to 24437. [2018-11-12 17:23:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24437 states. [2018-11-12 17:23:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24437 states to 24437 states and 37318 transitions. [2018-11-12 17:23:40,124 INFO L78 Accepts]: Start accepts. Automaton has 24437 states and 37318 transitions. Word has length 298 [2018-11-12 17:23:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:23:40,124 INFO L480 AbstractCegarLoop]: Abstraction has 24437 states and 37318 transitions. [2018-11-12 17:23:40,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 17:23:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 24437 states and 37318 transitions. [2018-11-12 17:23:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-12 17:23:40,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:23:40,167 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:23:40,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:23:40,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash -393737575, now seen corresponding path program 1 times [2018-11-12 17:23:40,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:23:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:23:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:40,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:23:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:23:40,751 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 17:23:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 149 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 17:23:41,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:23:41,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:23:41,019 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-12 17:23:41,020 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [315], [318], [322], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [853], [855], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:23:41,027 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:23:41,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:23:45,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 17:23:45,662 INFO L272 AbstractInterpreter]: Visited 182 different actions 722 times. Merged at 8 different actions 32 times. Never widened. Performed 17468 root evaluator evaluations with a maximum evaluation depth of 6. Performed 17468 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-12 17:23:45,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:45,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 17:23:45,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:23:45,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 17:23:45,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:23:45,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 17:23:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:23:45,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 17:23:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-12 17:23:46,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 17:23:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 149 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 17:23:46,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 17:23:46,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-12 17:23:46,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 17:23:46,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 17:23:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 17:23:46,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-12 17:23:46,498 INFO L87 Difference]: Start difference. First operand 24437 states and 37318 transitions. Second operand 10 states. [2018-11-12 17:23:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 17:23:53,252 INFO L93 Difference]: Finished difference Result 65867 states and 110938 transitions. [2018-11-12 17:23:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 17:23:53,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 309 [2018-11-12 17:23:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 17:23:53,505 INFO L225 Difference]: With dead ends: 65867 [2018-11-12 17:23:53,505 INFO L226 Difference]: Without dead ends: 43320 [2018-11-12 17:23:53,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-11-12 17:23:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43320 states. [2018-11-12 17:23:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43320 to 42215. [2018-11-12 17:23:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42215 states. [2018-11-12 17:23:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42215 states to 42215 states and 58234 transitions. [2018-11-12 17:23:54,726 INFO L78 Accepts]: Start accepts. Automaton has 42215 states and 58234 transitions. Word has length 309 [2018-11-12 17:23:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 17:23:54,727 INFO L480 AbstractCegarLoop]: Abstraction has 42215 states and 58234 transitions. [2018-11-12 17:23:54,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 17:23:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 42215 states and 58234 transitions. [2018-11-12 17:23:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-12 17:23:54,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 17:23:54,793 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 17:23:54,794 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 17:23:54,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1418709675, now seen corresponding path program 1 times [2018-11-12 17:23:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 17:23:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:54,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 17:23:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 17:23:54,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 17:23:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 17:23:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 155 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 17:23:55,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 17:23:55,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 17:23:55,144 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-12 17:23:55,144 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [135], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [853], [855], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-12 17:23:55,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 17:23:55,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 17:23:57,354 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 17:23:57,354 INFO L272 AbstractInterpreter]: Visited 179 different actions 354 times. Merged at 5 different actions 7 times. Never widened. Performed 11283 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11283 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-12 17:23:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 17:23:57,359 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 17:23:58,748 INFO L227 lantSequenceWeakener]: Weakened 310 states. On average, predicates are now at 71.25% of their original sizes. [2018-11-12 17:23:58,748 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 17:23:59,111 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-12 17:23:59,111 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 17:23:59,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 17:23:59,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-12 17:23:59,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 17:23:59,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 17:23:59,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 17:23:59,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-12 17:23:59,113 INFO L87 Difference]: Start difference. First operand 42215 states and 58234 transitions. Second operand 17 states. Received shutdown request... [2018-11-12 17:24:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 17:24:52,879 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 17:24:52,885 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 17:24:52,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:24:52 BoogieIcfgContainer [2018-11-12 17:24:52,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 17:24:52,886 INFO L168 Benchmark]: Toolchain (without parser) took 232370.90 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -320.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-12 17:24:52,887 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:24:52,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1260.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:52,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 217.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -859.3 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:52,889 INFO L168 Benchmark]: Boogie Preprocessor took 147.70 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 17:24:52,890 INFO L168 Benchmark]: RCFGBuilder took 4941.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.0 MB). Peak memory consumption was 260.0 MB. Max. memory is 7.1 GB. [2018-11-12 17:24:52,890 INFO L168 Benchmark]: TraceAbstraction took 225798.23 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 204.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 17:24:52,895 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1260.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 217.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -859.3 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.70 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4941.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 260.0 MB). Peak memory consumption was 260.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225798.23 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.9 GB in the beginning and 1.7 GB in the end (delta: 204.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1536]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1536). Cancelled while BasicCegarLoop was constructing difference of abstraction (42215states) and FLOYD_HOARE automaton (currently 14 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (14953 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 225.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 185.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2464 SDtfs, 11489 SDslu, 2674 SDs, 0 SdLazy, 20638 SolverSat, 2650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 117.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2141 GetRequests, 1978 SyntacticMatches, 39 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42215occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 16.5s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9990296753184029 AbsIntWeakeningRatio, 0.2377142857142857 AbsIntAvgWeakeningVarsNumRemoved, 45.950857142857146 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 2125 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 3048 NumberOfCodeBlocks, 3048 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3617 ConstructedInterpolants, 0 QuantifiedInterpolants, 2728021 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2377 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1442/1555 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown