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-EXP.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 09:54:15,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 09:54:15,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 09:54:15,336 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 09:54:15,336 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 09:54:15,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 09:54:15,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 09:54:15,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 09:54:15,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 09:54:15,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 09:54:15,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 09:54:15,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 09:54:15,355 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 09:54:15,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 09:54:15,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 09:54:15,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 09:54:15,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 09:54:15,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 09:54:15,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 09:54:15,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 09:54:15,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 09:54:15,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 09:54:15,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 09:54:15,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 09:54:15,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 09:54:15,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 09:54:15,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 09:54:15,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 09:54:15,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 09:54:15,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 09:54:15,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 09:54:15,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 09:54:15,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 09:54:15,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 09:54:15,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 09:54:15,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 09:54:15,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 09:54:15,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 09:54:15,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 09:54:15,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 09:54:15,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 09:54:15,410 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 09:54:15,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 09:54:15,410 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 09:54:15,410 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 09:54:15,411 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 09:54:15,411 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 09:54:15,411 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 09:54:15,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 09:54:15,411 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 09:54:15,412 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 09:54:15,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 09:54:15,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 09:54:15,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 09:54:15,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 09:54:15,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 09:54:15,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 09:54:15,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 09:54:15,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 09:54:15,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 09:54:15,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 09:54:15,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 09:54:15,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 09:54:15,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 09:54:15,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 09:54:15,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 09:54:15,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 09:54:15,417 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 09:54:15,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 09:54:15,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 09:54:15,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 09:54:15,418 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 09:54:15,418 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 09:54:15,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 09:54:15,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 09:54:15,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 09:54:15,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 09:54:15,501 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 09:54:15,502 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 09:54:15,564 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0285057a/980774de97284e5a8a40542de488c38a/FLAGec7f71635 [2018-11-07 09:54:16,158 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 09:54:16,159 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 09:54:16,171 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0285057a/980774de97284e5a8a40542de488c38a/FLAGec7f71635 [2018-11-07 09:54:16,186 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0285057a/980774de97284e5a8a40542de488c38a [2018-11-07 09:54:16,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 09:54:16,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 09:54:16,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 09:54:16,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 09:54:16,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 09:54:16,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f50207e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16, skipping insertion in model container [2018-11-07 09:54:16,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 09:54:16,276 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 09:54:16,611 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:54:16,616 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 09:54:16,727 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:54:16,745 INFO L193 MainTranslator]: Completed translation [2018-11-07 09:54:16,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16 WrapperNode [2018-11-07 09:54:16,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 09:54:16,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 09:54:16,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 09:54:16,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 09:54:16,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 09:54:16,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 09:54:16,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 09:54:16,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 09:54:16,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (1/1) ... [2018-11-07 09:54:16,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 09:54:16,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 09:54:16,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 09:54:16,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 09:54:16,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (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-07 09:54:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 09:54:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 09:54:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 09:54:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 09:54:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 09:54:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 09:54:18,888 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 09:54:18,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:54:18 BoogieIcfgContainer [2018-11-07 09:54:18,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 09:54:18,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 09:54:18,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 09:54:18,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 09:54:18,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:54:16" (1/3) ... [2018-11-07 09:54:18,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d615bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:54:18, skipping insertion in model container [2018-11-07 09:54:18,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:54:16" (2/3) ... [2018-11-07 09:54:18,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d615bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:54:18, skipping insertion in model container [2018-11-07 09:54:18,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:54:18" (3/3) ... [2018-11-07 09:54:18,899 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-07 09:54:18,907 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 09:54:18,916 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 09:54:18,930 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 09:54:18,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 09:54:18,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 09:54:18,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 09:54:18,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 09:54:18,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 09:54:18,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 09:54:18,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 09:54:18,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 09:54:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-07 09:54:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 09:54:18,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:18,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:19,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:19,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-07 09:54:19,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:19,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:19,165 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-07 09:54:19,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:19,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 09:54:19,168 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:19,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 09:54:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 09:54:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 09:54:19,190 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-07 09:54:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:19,225 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-07 09:54:19,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 09:54:19,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-07 09:54:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:19,240 INFO L225 Difference]: With dead ends: 222 [2018-11-07 09:54:19,241 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 09:54:19,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 09:54:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 09:54:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-07 09:54:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 09:54:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-07 09:54:19,293 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-07 09:54:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:19,293 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-07 09:54:19,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 09:54:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-07 09:54:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 09:54:19,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:19,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:19,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:19,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-07 09:54:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:19,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:19,390 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-07 09:54:19,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:19,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:19,391 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:19,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:19,394 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-07 09:54:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:19,708 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-07 09:54:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:19,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-07 09:54:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:19,712 INFO L225 Difference]: With dead ends: 205 [2018-11-07 09:54:19,712 INFO L226 Difference]: Without dead ends: 107 [2018-11-07 09:54:19,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-07 09:54:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-07 09:54:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 09:54:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-07 09:54:19,727 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-07 09:54:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:19,727 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-07 09:54:19,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-07 09:54:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 09:54:19,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:19,729 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:19,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:19,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-07 09:54:19,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:19,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:19,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:19,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:19,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:19,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:19,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:19,938 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-11-07 09:54:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:20,278 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-07 09:54:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:20,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 09:54:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:20,283 INFO L225 Difference]: With dead ends: 209 [2018-11-07 09:54:20,283 INFO L226 Difference]: Without dead ends: 190 [2018-11-07 09:54:20,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-07 09:54:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-07 09:54:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-07 09:54:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-07 09:54:20,303 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-07 09:54:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:20,303 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-07 09:54:20,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-07 09:54:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 09:54:20,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:20,305 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:20,305 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:20,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-07 09:54:20,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:20,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:20,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:20,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:20,444 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-07 09:54:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:20,574 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-07 09:54:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:20,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-07 09:54:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:20,580 INFO L225 Difference]: With dead ends: 297 [2018-11-07 09:54:20,580 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 09:54:20,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 09:54:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-07 09:54:20,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-07 09:54:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-07 09:54:20,608 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-07 09:54:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:20,608 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-07 09:54:20,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-07 09:54:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 09:54:20,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:20,610 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:20,614 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:20,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:20,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-07 09:54:20,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 09:54:20,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:20,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:20,768 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:20,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:20,770 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-07 09:54:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:20,953 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-07 09:54:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:20,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-07 09:54:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:20,957 INFO L225 Difference]: With dead ends: 230 [2018-11-07 09:54:20,958 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 09:54:20,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 09:54:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-07 09:54:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-07 09:54:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-07 09:54:20,980 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-07 09:54:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:20,980 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-07 09:54:20,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-07 09:54:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 09:54:20,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:20,982 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:20,982 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:20,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-07 09:54:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:20,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:20,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:20,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:21,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:21,171 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:21,172 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-07 09:54:21,174 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-11-07 09:54:21,213 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:21,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:21,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:21,742 INFO L272 AbstractInterpreter]: Visited 24 different actions 49 times. Merged at 17 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-07 09:54:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:21,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:21,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:21,791 INFO L194 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-07 09:54:21,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:21,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:21,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:22,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:22,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 09:54:22,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:22,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:54:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:54:22,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:54:22,200 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-07 09:54:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:22,539 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-07 09:54:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:54:22,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-07 09:54:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:22,544 INFO L225 Difference]: With dead ends: 192 [2018-11-07 09:54:22,544 INFO L226 Difference]: Without dead ends: 174 [2018-11-07 09:54:22,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:54:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-07 09:54:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-07 09:54:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-07 09:54:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-07 09:54:22,556 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-07 09:54:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:22,556 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-07 09:54:22,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:54:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-07 09:54:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 09:54:22,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:22,558 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:22,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:22,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-11-07 09:54:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:22,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:22,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:22,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:22,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:22,737 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:22,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 09:54:22,738 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [520], [523], [524], [525] [2018-11-07 09:54:22,740 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:22,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:22,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:22,951 INFO L272 AbstractInterpreter]: Visited 25 different actions 51 times. Merged at 18 different actions 22 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 40 variables. [2018-11-07 09:54:22,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:22,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:22,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:22,997 INFO L194 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-07 09:54:23,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:23,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:23,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:23,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:23,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:23,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 09:54:23,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:23,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:54:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:54:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:54:23,292 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 4 states. [2018-11-07 09:54:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:23,702 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-07 09:54:23,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:54:23,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-07 09:54:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:23,704 INFO L225 Difference]: With dead ends: 230 [2018-11-07 09:54:23,704 INFO L226 Difference]: Without dead ends: 226 [2018-11-07 09:54:23,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:54:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-07 09:54:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-07 09:54:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-07 09:54:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-07 09:54:23,716 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-07 09:54:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:23,717 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-07 09:54:23,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:54:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-07 09:54:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 09:54:23,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:23,718 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:23,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:23,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-11-07 09:54:23,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:23,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:23,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 09:54:23,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:23,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:23,809 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:23,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:23,810 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-07 09:54:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:23,968 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-07 09:54:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:23,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-07 09:54:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:23,971 INFO L225 Difference]: With dead ends: 391 [2018-11-07 09:54:23,971 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 09:54:23,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 09:54:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-07 09:54:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 09:54:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-07 09:54:23,985 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-07 09:54:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-07 09:54:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-07 09:54:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 09:54:23,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:23,987 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:23,987 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:23,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-07 09:54:23,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:23,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:23,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:23,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:24,816 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-11-07 09:54:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:24,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:24,828 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:24,828 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 09:54:24,829 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-11-07 09:54:24,831 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:24,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:25,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:25,052 INFO L272 AbstractInterpreter]: Visited 28 different actions 57 times. Merged at 21 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 43 variables. [2018-11-07 09:54:25,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:25,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:25,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:25,089 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:25,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:25,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:25,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 09:54:25,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:25,787 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-11-07 09:54:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 09:54:25,891 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:54:25,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-07 09:54:25,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:25,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:54:25,893 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2018-11-07 09:54:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:25,937 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2018-11-07 09:54:25,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:25,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-07 09:54:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:25,939 INFO L225 Difference]: With dead ends: 203 [2018-11-07 09:54:25,940 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 09:54:25,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:54:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 09:54:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-11-07 09:54:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-07 09:54:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2018-11-07 09:54:25,949 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 31 [2018-11-07 09:54:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:25,950 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2018-11-07 09:54:25,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2018-11-07 09:54:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 09:54:25,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:25,951 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:25,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:25,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-11-07 09:54:25,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:25,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:25,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 09:54:26,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:26,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:26,047 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:26,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:26,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:26,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:26,048 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 3 states. [2018-11-07 09:54:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:26,180 INFO L93 Difference]: Finished difference Result 348 states and 524 transitions. [2018-11-07 09:54:26,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:26,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-07 09:54:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:26,183 INFO L225 Difference]: With dead ends: 348 [2018-11-07 09:54:26,184 INFO L226 Difference]: Without dead ends: 198 [2018-11-07 09:54:26,184 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:26,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-07 09:54:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-07 09:54:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-07 09:54:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2018-11-07 09:54:26,192 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 36 [2018-11-07 09:54:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:26,193 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2018-11-07 09:54:26,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2018-11-07 09:54:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 09:54:26,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:26,194 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:26,195 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:26,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:26,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-11-07 09:54:26,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:26,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:26,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:26,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:54:26,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:26,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:26,354 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-07 09:54:26,355 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-11-07 09:54:26,357 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:26,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:26,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:26,550 INFO L272 AbstractInterpreter]: Visited 30 different actions 79 times. Merged at 23 different actions 41 times. Never widened. Found 9 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-07 09:54:26,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:26,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:26,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:26,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:26,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:26,606 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:26,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:54:26,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:27,358 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-11-07 09:54:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:54:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:27,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-07 09:54:27,556 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:27,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 09:54:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 09:54:27,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:54:27,557 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand 5 states. [2018-11-07 09:54:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:27,818 INFO L93 Difference]: Finished difference Result 255 states and 378 transitions. [2018-11-07 09:54:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 09:54:27,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-07 09:54:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:27,823 INFO L225 Difference]: With dead ends: 255 [2018-11-07 09:54:27,823 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 09:54:27,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:54:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 09:54:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2018-11-07 09:54:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-07 09:54:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-07 09:54:27,835 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-07 09:54:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:27,836 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-07 09:54:27,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 09:54:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-07 09:54:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 09:54:27,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:27,837 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:27,837 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:27,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:27,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-07 09:54:27,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:27,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:27,844 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:28,114 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:28,272 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:28,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:28,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:28,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-07 09:54:28,379 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-11-07 09:54:28,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:28,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:28,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:28,612 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 26 different actions 44 times. Never widened. Found 9 fixpoints after 6 different actions. Largest state had 44 variables. [2018-11-07 09:54:28,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:28,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:28,641 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:28,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:28,658 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:28,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:29,023 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-07 09:54:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:29,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:29,349 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 12 [2018-11-07 09:54:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:29,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-11-07 09:54:29,509 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:29,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:54:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:54:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 09:54:29,510 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 6 states. [2018-11-07 09:54:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:29,894 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-07 09:54:29,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 09:54:29,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-07 09:54:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:29,898 INFO L225 Difference]: With dead ends: 254 [2018-11-07 09:54:29,898 INFO L226 Difference]: Without dead ends: 252 [2018-11-07 09:54:29,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 09:54:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-07 09:54:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-07 09:54:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-07 09:54:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-07 09:54:29,907 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-07 09:54:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:29,907 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-07 09:54:29,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:54:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-07 09:54:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 09:54:29,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:29,908 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:29,909 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:29,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:29,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-07 09:54:29,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:29,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:29,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:29,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 09:54:29,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:29,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:29,989 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:29,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:29,990 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-07 09:54:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:30,190 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-07 09:54:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:30,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-07 09:54:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:30,194 INFO L225 Difference]: With dead ends: 428 [2018-11-07 09:54:30,194 INFO L226 Difference]: Without dead ends: 229 [2018-11-07 09:54:30,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-07 09:54:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-07 09:54:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-07 09:54:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-07 09:54:30,204 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-07 09:54:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:30,205 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-07 09:54:30,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-07 09:54:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 09:54:30,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:30,206 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:30,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:30,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-07 09:54:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:30,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:30,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 09:54:30,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:54:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:54:30,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:54:30,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:54:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:54:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:30,303 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-07 09:54:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:30,561 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-07 09:54:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:54:30,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-07 09:54:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:30,563 INFO L225 Difference]: With dead ends: 309 [2018-11-07 09:54:30,563 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 09:54:30,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:54:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 09:54:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-07 09:54:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-07 09:54:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-07 09:54:30,572 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-07 09:54:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:30,572 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-07 09:54:30,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 09:54:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-07 09:54:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 09:54:30,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:30,573 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:30,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:30,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-07 09:54:30,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:30,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:30,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:54:31,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:31,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:31,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-07 09:54:31,013 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-11-07 09:54:31,015 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:31,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:31,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:31,242 INFO L272 AbstractInterpreter]: Visited 39 different actions 97 times. Merged at 31 different actions 49 times. Never widened. Found 11 fixpoints after 7 different actions. Largest state had 46 variables. [2018-11-07 09:54:31,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:31,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:31,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:31,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:31,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:31,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:31,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:31,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:32,157 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-07 09:54:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-07 09:54:32,918 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:32,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:54:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:54:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 09:54:32,919 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-07 09:54:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:33,371 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2018-11-07 09:54:33,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 09:54:33,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-07 09:54:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:33,373 INFO L225 Difference]: With dead ends: 190 [2018-11-07 09:54:33,373 INFO L226 Difference]: Without dead ends: 186 [2018-11-07 09:54:33,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 09:54:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-07 09:54:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-11-07 09:54:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-07 09:54:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2018-11-07 09:54:33,381 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 51 [2018-11-07 09:54:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2018-11-07 09:54:33,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:54:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2018-11-07 09:54:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 09:54:33,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:33,382 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:33,382 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 412447638, now seen corresponding path program 1 times [2018-11-07 09:54:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:33,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:33,606 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:33,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:33,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:33,847 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-07 09:54:33,847 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [506], [520], [523], [524], [525] [2018-11-07 09:54:33,849 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:33,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:34,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:34,044 INFO L272 AbstractInterpreter]: Visited 43 different actions 105 times. Merged at 35 different actions 53 times. Never widened. Found 11 fixpoints after 7 different actions. Largest state had 50 variables. [2018-11-07 09:54:34,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:34,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:34,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:34,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:34,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:34,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:34,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 09:54:34,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:34,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2018-11-07 09:54:34,638 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:34,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:54:34,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:54:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-07 09:54:34,639 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 9 states. [2018-11-07 09:54:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:35,265 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2018-11-07 09:54:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 09:54:35,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-07 09:54:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:35,268 INFO L225 Difference]: With dead ends: 193 [2018-11-07 09:54:35,268 INFO L226 Difference]: Without dead ends: 191 [2018-11-07 09:54:35,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:54:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-07 09:54:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2018-11-07 09:54:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-07 09:54:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-07 09:54:35,280 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 55 [2018-11-07 09:54:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:35,280 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-07 09:54:35,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:54:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-07 09:54:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-07 09:54:35,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:35,281 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:35,282 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:35,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-07 09:54:35,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:35,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:35,283 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:35,514 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:35,686 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:36,130 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-07 09:54:36,345 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 09:54:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:36,545 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:36,545 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-07 09:54:36,545 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 09:54:36,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:36,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:36,810 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:36,810 INFO L272 AbstractInterpreter]: Visited 44 different actions 109 times. Merged at 35 different actions 55 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:36,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:36,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:36,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:36,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:36,858 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:36,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:37,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:37,753 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 18 [2018-11-07 09:54:38,139 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2018-11-07 09:54:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 09:54:38,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:38,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-11-07 09:54:38,195 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 09:54:38,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 09:54:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-07 09:54:38,197 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 9 states. [2018-11-07 09:54:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:38,790 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2018-11-07 09:54:38,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 09:54:38,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-07 09:54:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:38,792 INFO L225 Difference]: With dead ends: 185 [2018-11-07 09:54:38,792 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 09:54:38,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-07 09:54:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 09:54:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-07 09:54:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-07 09:54:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-07 09:54:38,802 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-07 09:54:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:38,803 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-07 09:54:38,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 09:54:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-07 09:54:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 09:54:38,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:38,804 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:38,804 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:38,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:38,805 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-07 09:54:38,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:38,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:38,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:39,042 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:39,201 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:39,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:39,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:39,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-07 09:54:39,284 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 09:54:39,286 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:39,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:39,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:39,471 INFO L272 AbstractInterpreter]: Visited 44 different actions 109 times. Merged at 35 different actions 55 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:39,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:39,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:39,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:39,492 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:39,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:39,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:39,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:39,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 09:54:39,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:39,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 12 [2018-11-07 09:54:39,806 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:39,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 09:54:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 09:54:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-07 09:54:39,807 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 8 states. [2018-11-07 09:54:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:39,940 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-07 09:54:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 09:54:39,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-07 09:54:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:39,943 INFO L225 Difference]: With dead ends: 203 [2018-11-07 09:54:39,943 INFO L226 Difference]: Without dead ends: 200 [2018-11-07 09:54:39,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-07 09:54:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-07 09:54:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-07 09:54:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-07 09:54:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-07 09:54:39,952 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-07 09:54:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:39,953 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-07 09:54:39,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 09:54:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-07 09:54:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 09:54:39,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:39,954 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:39,954 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:39,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-07 09:54:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:39,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:39,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 09:54:40,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:40,621 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:40,621 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-07 09:54:40,621 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 09:54:40,623 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:40,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:40,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:40,828 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:40,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:40,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:40,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:40,864 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:40,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:40,878 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:40,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 09:54:41,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-07 09:54:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:41,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-11-07 09:54:41,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:41,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 09:54:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 09:54:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:54:41,365 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-07 09:54:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:41,507 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-07 09:54:41,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 09:54:41,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-07 09:54:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:41,510 INFO L225 Difference]: With dead ends: 224 [2018-11-07 09:54:41,510 INFO L226 Difference]: Without dead ends: 221 [2018-11-07 09:54:41,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:54:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-07 09:54:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-07 09:54:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-07 09:54:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-07 09:54:41,520 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-07 09:54:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:41,521 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-07 09:54:41,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 09:54:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-07 09:54:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-07 09:54:41,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:41,522 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:41,522 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:41,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-07 09:54:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:41,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:41,783 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:41,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:41,994 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:41,994 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-07 09:54:41,994 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 09:54:41,996 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:41,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:42,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:42,173 INFO L272 AbstractInterpreter]: Visited 44 different actions 107 times. Merged at 35 different actions 53 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:42,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:42,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:42,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:42,213 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:42,228 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:42,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:42,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 09:54:43,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:43,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2018-11-07 09:54:43,336 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:43,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 09:54:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 09:54:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:54:43,337 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 10 states. [2018-11-07 09:54:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:43,615 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-07 09:54:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 09:54:43,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-11-07 09:54:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:43,618 INFO L225 Difference]: With dead ends: 221 [2018-11-07 09:54:43,618 INFO L226 Difference]: Without dead ends: 219 [2018-11-07 09:54:43,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:54:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-07 09:54:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-07 09:54:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-07 09:54:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-07 09:54:43,628 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-07 09:54:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:43,628 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-07 09:54:43,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:54:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-07 09:54:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 09:54:43,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:43,629 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:43,630 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:43,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:43,630 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-07 09:54:43,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:43,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:43,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 09:54:43,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:43,989 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:43,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-07 09:54:43,989 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-07 09:54:43,991 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:43,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:44,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:44,146 INFO L272 AbstractInterpreter]: Visited 46 different actions 111 times. Merged at 37 different actions 55 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:44,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:44,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:44,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:44,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:44,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:44,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:44,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 09:54:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-11-07 09:54:45,189 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:45,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 09:54:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 09:54:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:54:45,190 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-07 09:54:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:45,406 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2018-11-07 09:54:45,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 09:54:45,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-07 09:54:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:45,409 INFO L225 Difference]: With dead ends: 264 [2018-11-07 09:54:45,409 INFO L226 Difference]: Without dead ends: 260 [2018-11-07 09:54:45,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-07 09:54:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-07 09:54:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-11-07 09:54:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-07 09:54:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2018-11-07 09:54:45,421 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 93 [2018-11-07 09:54:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:45,421 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2018-11-07 09:54:45,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 09:54:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2018-11-07 09:54:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 09:54:45,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:45,423 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:45,423 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:45,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1152837687, now seen corresponding path program 1 times [2018-11-07 09:54:45,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:45,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:45,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:45,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:45,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:46,077 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-07 09:54:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 20 proven. 134 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 09:54:46,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:46,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:46,494 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-07 09:54:46,494 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [506], [508], [520], [523], [524], [525] [2018-11-07 09:54:46,496 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:54:46,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:54:46,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:54:46,662 INFO L272 AbstractInterpreter]: Visited 44 different actions 107 times. Merged at 35 different actions 53 times. Never widened. Found 13 fixpoints after 8 different actions. Largest state had 50 variables. [2018-11-07 09:54:46,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:46,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:54:46,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:46,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:46,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:46,717 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:54:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:46,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:47,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:47,706 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-07 09:54:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 34 proven. 88 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 09:54:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 26 [2018-11-07 09:54:47,810 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:47,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 09:54:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 09:54:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-11-07 09:54:47,811 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 20 states. [2018-11-07 09:54:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:48,468 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2018-11-07 09:54:48,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 09:54:48,471 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-07 09:54:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:48,473 INFO L225 Difference]: With dead ends: 270 [2018-11-07 09:54:48,473 INFO L226 Difference]: Without dead ends: 268 [2018-11-07 09:54:48,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 09:54:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-07 09:54:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2018-11-07 09:54:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-07 09:54:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-07 09:54:48,484 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 97 [2018-11-07 09:54:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:48,484 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-07 09:54:48,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 09:54:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-07 09:54:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 09:54:48,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:54:48,485 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:54:48,486 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:54:48,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:54:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-07 09:54:48,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:54:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:54:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:54:48,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:54:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:54:48,777 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 09:54:49,247 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-07 09:54:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:54:49,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:49,410 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:54:49,410 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 09:54:49,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 09:54:49,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:54:49,411 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 09:54:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 09:54:49,422 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 09:54:49,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 09:54:49,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 09:54:49,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:54:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 09:54:49,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:54:50,385 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 21 [2018-11-07 09:54:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 09:54:50,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:54:50,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2018-11-07 09:54:50,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:54:50,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 09:54:50,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 09:54:50,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-07 09:54:50,888 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 18 states. [2018-11-07 09:54:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:54:51,720 INFO L93 Difference]: Finished difference Result 269 states and 372 transitions. [2018-11-07 09:54:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 09:54:51,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-11-07 09:54:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:54:51,721 INFO L225 Difference]: With dead ends: 269 [2018-11-07 09:54:51,721 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 09:54:51,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 09:54:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 09:54:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 09:54:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 09:54:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 09:54:51,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-07 09:54:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:54:51,725 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 09:54:51,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 09:54:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 09:54:51,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 09:54:51,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 09:54:51,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 09:54:51,838 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 111 [2018-11-07 09:54:52,765 WARN L179 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2018-11-07 09:54:52,871 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2018-11-07 09:54:52,875 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 09:54:52,875 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 09:54:52,875 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 09:54:52,875 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 09:54:52,875 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 09:54:52,875 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-07 09:54:52,876 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-07 09:54:52,877 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-07 09:54:52,878 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-07 09:54:52,879 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-07 09:54:52,880 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-07 09:54:52,881 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-07 09:54:52,882 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-07 09:54:52,883 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse2 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse3 (<= main_~this_buffer_empty~0 1)) (.cse5 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse4 (<= 0 (+ main_~P8~0 2147483648))) (.cse6 (<= main_~P8~0 2147483647)) (.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and .cse2 (and .cse3 .cse4 (= main_~q~0 4) .cse5 .cse6)) (and .cse2 (and .cse4 (= main_~q~0 3) .cse6 .cse0 .cse1)) (and .cse7 (and (= main_~q~0 1) .cse3 .cse4 .cse5 .cse6)) (and .cse7 (<= 5 main_~q~0) .cse4 .cse6 .cse0 .cse1))) [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-07 09:54:52,884 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-07 09:54:52,885 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-07 09:54:52,885 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-07 09:54:52,886 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-07 09:54:52,887 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-07 09:54:52,893 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,909 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,910 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,911 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,913 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,914 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:54:52 BoogieIcfgContainer [2018-11-07 09:54:52,916 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 09:54:52,919 INFO L168 Benchmark]: Toolchain (without parser) took 36721.51 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -947.5 MB). Peak memory consumption was 222.2 MB. Max. memory is 7.1 GB. [2018-11-07 09:54:52,920 INFO L168 Benchmark]: CDTParser took 0.22 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-07 09:54:52,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-07 09:54:52,921 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 09:54:52,924 INFO L168 Benchmark]: Boogie Preprocessor took 167.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-11-07 09:54:52,924 INFO L168 Benchmark]: RCFGBuilder took 1944.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2018-11-07 09:54:52,925 INFO L168 Benchmark]: TraceAbstraction took 34024.68 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 436.2 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -220.8 MB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. [2018-11-07 09:54:52,934 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.22 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 546.57 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 167.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1944.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34024.68 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 436.2 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -220.8 MB). Peak memory consumption was 215.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-11-07 09:54:52,949 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((this_buffer_empty <= 1 && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((0 <= P8 + 2147483648 && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && (((q == 1 && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-07 09:54:52,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,954 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,955 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-07 09:54:52,955 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 3824 SDtfs, 2391 SDslu, 12973 SDs, 0 SdLazy, 1943 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1868 GetRequests, 1664 SyntacticMatches, 16 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 13 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 88 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 206 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3506 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 923 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1913 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2758 ConstructedInterpolants, 297 QuantifiedInterpolants, 2075008 SizeOfPredicates, 73 NumberOfNonLiveVariables, 5546 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 1092/2998 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...