java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-24 02:29:29,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 02:29:29,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 02:29:29,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 02:29:29,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 02:29:29,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 02:29:29,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 02:29:29,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 02:29:29,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 02:29:29,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 02:29:29,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 02:29:29,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 02:29:29,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 02:29:29,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 02:29:29,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 02:29:29,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 02:29:29,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 02:29:29,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 02:29:29,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 02:29:29,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 02:29:29,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 02:29:29,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 02:29:29,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 02:29:29,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 02:29:29,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 02:29:29,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 02:29:29,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 02:29:29,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 02:29:29,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 02:29:29,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 02:29:29,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 02:29:29,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 02:29:29,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 02:29:29,621 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 02:29:29,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 02:29:29,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 02:29:29,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 02:29:29,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 02:29:29,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 02:29:29,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 02:29:29,648 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 02:29:29,648 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 02:29:29,649 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 02:29:29,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 02:29:29,649 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 02:29:29,649 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 02:29:29,650 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 02:29:29,650 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 02:29:29,650 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 02:29:29,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 02:29:29,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 02:29:29,651 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 02:29:29,651 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 02:29:29,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 02:29:29,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 02:29:29,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 02:29:29,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 02:29:29,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 02:29:29,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 02:29:29,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 02:29:29,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 02:29:29,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 02:29:29,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 02:29:29,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 02:29:29,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 02:29:29,656 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 02:29:29,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 02:29:29,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 02:29:29,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 02:29:29,657 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 02:29:29,657 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 02:29:29,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 02:29:29,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 02:29:29,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 02:29:29,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 02:29:29,743 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 02:29:29,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 02:29:29,825 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/338cd6e66/14dba15e1a4744948bd5b435d64c48e5/FLAGf38a0ee31 [2018-10-24 02:29:30,367 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 02:29:30,368 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 02:29:30,389 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/338cd6e66/14dba15e1a4744948bd5b435d64c48e5/FLAGf38a0ee31 [2018-10-24 02:29:30,403 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/338cd6e66/14dba15e1a4744948bd5b435d64c48e5 [2018-10-24 02:29:30,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 02:29:30,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 02:29:30,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 02:29:30,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 02:29:30,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 02:29:30,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:30,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4209c093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30, skipping insertion in model container [2018-10-24 02:29:30,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:30,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 02:29:30,512 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 02:29:30,888 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 02:29:30,893 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 02:29:30,967 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 02:29:30,983 INFO L193 MainTranslator]: Completed translation [2018-10-24 02:29:30,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30 WrapperNode [2018-10-24 02:29:30,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 02:29:30,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 02:29:30,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 02:29:30,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 02:29:30,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 02:29:31,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 02:29:31,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 02:29:31,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 02:29:31,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... [2018-10-24 02:29:31,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 02:29:31,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 02:29:31,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 02:29:31,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 02:29:31,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:29:31,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 02:29:31,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 02:29:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 02:29:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 02:29:31,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 02:29:31,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 02:29:33,166 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 02:29:33,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:29:33 BoogieIcfgContainer [2018-10-24 02:29:33,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 02:29:33,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 02:29:33,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 02:29:33,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 02:29:33,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:29:30" (1/3) ... [2018-10-24 02:29:33,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22637535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:29:33, skipping insertion in model container [2018-10-24 02:29:33,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:29:30" (2/3) ... [2018-10-24 02:29:33,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22637535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:29:33, skipping insertion in model container [2018-10-24 02:29:33,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:29:33" (3/3) ... [2018-10-24 02:29:33,175 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-10-24 02:29:33,183 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 02:29:33,190 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 02:29:33,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 02:29:33,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 02:29:33,239 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 02:29:33,239 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 02:29:33,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 02:29:33,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 02:29:33,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 02:29:33,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 02:29:33,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 02:29:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-10-24 02:29:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 02:29:33,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:33,269 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 02:29:33,272 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:33,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-10-24 02:29:33,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:33,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,322 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:33,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 02:29:33,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:33,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 02:29:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 02:29:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 02:29:33,441 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-10-24 02:29:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:33,481 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-10-24 02:29:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 02:29:33,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-24 02:29:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:33,498 INFO L225 Difference]: With dead ends: 222 [2018-10-24 02:29:33,499 INFO L226 Difference]: Without dead ends: 104 [2018-10-24 02:29:33,503 INFO L605 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-10-24 02:29:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-24 02:29:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-24 02:29:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-24 02:29:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-10-24 02:29:33,563 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-10-24 02:29:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:33,563 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-10-24 02:29:33,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 02:29:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-10-24 02:29:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 02:29:33,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:33,567 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 02:29:33,568 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:33,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-10-24 02:29:33,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:33,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:33,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:29:33,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:33,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:33,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:29:33,742 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-10-24 02:29:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:33,950 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-10-24 02:29:33,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:33,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-24 02:29:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:33,952 INFO L225 Difference]: With dead ends: 205 [2018-10-24 02:29:33,952 INFO L226 Difference]: Without dead ends: 107 [2018-10-24 02:29:33,954 INFO L605 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-10-24 02:29:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-24 02:29:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-24 02:29:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-24 02:29:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-10-24 02:29:33,967 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-10-24 02:29:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:33,967 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-10-24 02:29:33,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-10-24 02:29:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 02:29:33,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:33,969 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 02:29:33,969 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:33,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-10-24 02:29:33,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:33,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:33,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:34,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:29:34,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:34,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:29:34,194 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-10-24 02:29:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:34,823 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-10-24 02:29:34,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:34,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-24 02:29:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:34,827 INFO L225 Difference]: With dead ends: 209 [2018-10-24 02:29:34,827 INFO L226 Difference]: Without dead ends: 190 [2018-10-24 02:29:34,828 INFO L605 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-10-24 02:29:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-24 02:29:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-10-24 02:29:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-24 02:29:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-10-24 02:29:34,845 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-10-24 02:29:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:34,845 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-10-24 02:29:34,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-10-24 02:29:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-24 02:29:34,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:34,847 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-10-24 02:29:34,847 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:34,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-10-24 02:29:34,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:34,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:34,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:34,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:34,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:34,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:29:34,945 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:34,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:29:34,947 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-10-24 02:29:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:35,037 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-10-24 02:29:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:35,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-24 02:29:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:35,040 INFO L225 Difference]: With dead ends: 297 [2018-10-24 02:29:35,040 INFO L226 Difference]: Without dead ends: 128 [2018-10-24 02:29:35,041 INFO L605 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-10-24 02:29:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-24 02:29:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-24 02:29:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-24 02:29:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-10-24 02:29:35,052 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-10-24 02:29:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:35,053 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-10-24 02:29:35,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-10-24 02:29:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-24 02:29:35,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:35,055 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-10-24 02:29:35,055 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:35,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-10-24 02:29:35,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:35,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:35,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:35,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 02:29:35,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:35,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:29:35,135 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:35,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:35,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:29:35,137 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-10-24 02:29:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:35,260 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-10-24 02:29:35,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:35,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-24 02:29:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:35,263 INFO L225 Difference]: With dead ends: 230 [2018-10-24 02:29:35,263 INFO L226 Difference]: Without dead ends: 111 [2018-10-24 02:29:35,264 INFO L605 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-10-24 02:29:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-24 02:29:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-24 02:29:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-24 02:29:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-10-24 02:29:35,276 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-10-24 02:29:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:35,280 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-10-24 02:29:35,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-10-24 02:29:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-24 02:29:35,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:35,284 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-10-24 02:29:35,285 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:35,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:35,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-10-24 02:29:35,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:35,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:35,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:35,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:35,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:29:35,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:29:35,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-24 02:29:35,622 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-10-24 02:29:35,676 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:29:35,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:29:36,740 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:29:38,718 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 02:29:38,719 INFO L272 AbstractInterpreter]: Visited 23 different actions 47 times. Merged at 15 different actions 19 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-24 02:29:38,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:38,764 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 02:29:39,762 INFO L232 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 91.92% of their original sizes. [2018-10-24 02:29:39,762 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 02:29:41,145 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 02:29:41,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 02:29:41,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-24 02:29:41,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:41,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 02:29:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 02:29:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-24 02:29:41,148 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 13 states. [2018-10-24 02:29:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:52,014 INFO L93 Difference]: Finished difference Result 225 states and 347 transitions. [2018-10-24 02:29:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 02:29:52,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-24 02:29:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:52,017 INFO L225 Difference]: With dead ends: 225 [2018-10-24 02:29:52,017 INFO L226 Difference]: Without dead ends: 141 [2018-10-24 02:29:52,018 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-10-24 02:29:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-24 02:29:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-10-24 02:29:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-24 02:29:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2018-10-24 02:29:52,045 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 27 [2018-10-24 02:29:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:52,045 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2018-10-24 02:29:52,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 02:29:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2018-10-24 02:29:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 02:29:52,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:52,049 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-10-24 02:29:52,049 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:52,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-10-24 02:29:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:52,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:52,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:52,925 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-24 02:29:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:29:52,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:29:52,931 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:29:52,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-10-24 02:29:52,931 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-10-24 02:29:52,934 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:29:52,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:29:53,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:29:55,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:29:55,369 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-10-24 02:29:55,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:55,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:29:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:29:55,406 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:29:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:55,423 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:29:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:55,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:29:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 02:29:55,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:29:56,086 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-10-24 02:29:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 02:29:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-24 02:29:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-10-24 02:29:56,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:56,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 02:29:56,211 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand 3 states. [2018-10-24 02:29:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:56,250 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2018-10-24 02:29:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:56,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-24 02:29:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:56,252 INFO L225 Difference]: With dead ends: 138 [2018-10-24 02:29:56,252 INFO L226 Difference]: Without dead ends: 132 [2018-10-24 02:29:56,253 INFO L605 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-10-24 02:29:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-24 02:29:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-24 02:29:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-24 02:29:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 193 transitions. [2018-10-24 02:29:56,264 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 193 transitions. Word has length 31 [2018-10-24 02:29:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:56,264 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 193 transitions. [2018-10-24 02:29:56,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2018-10-24 02:29:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-24 02:29:56,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:56,266 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-10-24 02:29:56,267 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:56,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-10-24 02:29:56,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:56,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:56,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:56,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:56,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 02:29:56,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:29:56,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:29:56,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:29:56,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:29:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:29:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:29:56,380 INFO L87 Difference]: Start difference. First operand 131 states and 193 transitions. Second operand 3 states. [2018-10-24 02:29:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:29:56,538 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2018-10-24 02:29:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:29:56,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-24 02:29:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:29:56,540 INFO L225 Difference]: With dead ends: 218 [2018-10-24 02:29:56,540 INFO L226 Difference]: Without dead ends: 133 [2018-10-24 02:29:56,541 INFO L605 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-10-24 02:29:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-24 02:29:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-24 02:29:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-24 02:29:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2018-10-24 02:29:56,551 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 36 [2018-10-24 02:29:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:29:56,551 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2018-10-24 02:29:56,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:29:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2018-10-24 02:29:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-24 02:29:56,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:29:56,553 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-10-24 02:29:56,553 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:29:56,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:29:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-10-24 02:29:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:29:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:56,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:29:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:29:56,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:29:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:29:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 02:29:56,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:29:56,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:29:56,839 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-24 02:29:56,839 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-10-24 02:29:56,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:29:56,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:29:57,420 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:30:03,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:30:03,715 INFO L272 AbstractInterpreter]: Visited 30 different actions 136 times. Merged at 23 different actions 88 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 41 variables. [2018-10-24 02:30:03,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:03,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:30:03,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:03,721 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:30:03,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:03,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:30:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:03,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:30:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 02:30:03,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:30:04,394 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-10-24 02:30:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 02:30:04,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 02:30:04,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-10-24 02:30:04,590 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 02:30:04,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 02:30:04,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 02:30:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 02:30:04,591 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand 5 states. [2018-10-24 02:30:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:05,199 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2018-10-24 02:30:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 02:30:05,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-24 02:30:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:05,201 INFO L225 Difference]: With dead ends: 194 [2018-10-24 02:30:05,202 INFO L226 Difference]: Without dead ends: 188 [2018-10-24 02:30:05,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-24 02:30:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-24 02:30:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2018-10-24 02:30:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-24 02:30:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2018-10-24 02:30:05,217 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 37 [2018-10-24 02:30:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:05,218 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2018-10-24 02:30:05,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 02:30:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2018-10-24 02:30:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-24 02:30:05,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:05,219 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] [2018-10-24 02:30:05,220 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1280054677, now seen corresponding path program 1 times [2018-10-24 02:30:05,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:05,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:05,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:05,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:05,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 02:30:05,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:05,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:30:05,475 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-24 02:30:05,476 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], [344], [347], [350], [520], [523], [524], [525] [2018-10-24 02:30:05,477 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:30:05,478 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:30:05,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:30:10,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:30:10,645 INFO L272 AbstractInterpreter]: Visited 31 different actions 139 times. Merged at 24 different actions 89 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-24 02:30:10,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:10,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:30:10,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:10,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:30:10,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:10,662 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:30:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:10,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:30:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 02:30:10,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:30:10,988 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-10-24 02:30:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 02:30:11,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 02:30:11,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2018-10-24 02:30:11,072 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 02:30:11,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 02:30:11,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 02:30:11,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 02:30:11,073 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand 5 states. [2018-10-24 02:30:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:11,942 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2018-10-24 02:30:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 02:30:11,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-24 02:30:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:11,945 INFO L225 Difference]: With dead ends: 268 [2018-10-24 02:30:11,945 INFO L226 Difference]: Without dead ends: 254 [2018-10-24 02:30:11,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 02:30:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-24 02:30:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-24 02:30:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-24 02:30:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2018-10-24 02:30:11,964 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 38 [2018-10-24 02:30:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:11,964 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2018-10-24 02:30:11,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 02:30:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2018-10-24 02:30:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 02:30:11,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:11,965 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-10-24 02:30:11,965 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:11,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-10-24 02:30:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:11,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:11,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:12,171 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:30:12,315 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:30:12,495 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-24 02:30:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:12,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:12,499 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:30:12,499 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-10-24 02:30:12,499 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-10-24 02:30:12,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:30:12,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:30:12,831 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:30:19,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:30:19,423 INFO L272 AbstractInterpreter]: Visited 33 different actions 148 times. Merged at 26 different actions 97 times. Widened at 2 different actions 4 times. Found 17 fixpoints after 6 different actions. Largest state had 44 variables. [2018-10-24 02:30:19,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:19,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:30:19,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:19,431 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:30:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:19,439 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:30:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:19,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:30:19,630 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-10-24 02:30:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:19,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:30:19,841 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 12 [2018-10-24 02:30:20,407 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-10-24 02:30:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:20,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 02:30:20,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-10-24 02:30:20,483 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 02:30:20,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 02:30:20,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 02:30:20,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 02:30:20,485 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 6 states. [2018-10-24 02:30:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:20,897 INFO L93 Difference]: Finished difference Result 260 states and 381 transitions. [2018-10-24 02:30:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 02:30:20,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-24 02:30:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:20,901 INFO L225 Difference]: With dead ends: 260 [2018-10-24 02:30:20,901 INFO L226 Difference]: Without dead ends: 258 [2018-10-24 02:30:20,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 02:30:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-24 02:30:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 251. [2018-10-24 02:30:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-24 02:30:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2018-10-24 02:30:20,913 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 40 [2018-10-24 02:30:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:20,913 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2018-10-24 02:30:20,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 02:30:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2018-10-24 02:30:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-24 02:30:20,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:20,915 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-10-24 02:30:20,915 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:20,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-10-24 02:30:20,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:20,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:20,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 02:30:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:30:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:30:20,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:30:20,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:30:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:30:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:30:20,999 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 3 states. [2018-10-24 02:30:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:21,265 INFO L93 Difference]: Finished difference Result 440 states and 652 transitions. [2018-10-24 02:30:21,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:30:21,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-24 02:30:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:21,268 INFO L225 Difference]: With dead ends: 440 [2018-10-24 02:30:21,268 INFO L226 Difference]: Without dead ends: 235 [2018-10-24 02:30:21,269 INFO L605 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-10-24 02:30:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-24 02:30:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-24 02:30:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-24 02:30:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2018-10-24 02:30:21,281 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 41 [2018-10-24 02:30:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:21,281 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2018-10-24 02:30:21,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:30:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2018-10-24 02:30:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-24 02:30:21,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:21,282 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-10-24 02:30:21,282 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:21,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-10-24 02:30:21,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:21,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:21,286 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 02:30:21,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 02:30:21,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 02:30:21,378 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 02:30:21,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 02:30:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 02:30:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 02:30:21,380 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand 3 states. [2018-10-24 02:30:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:21,667 INFO L93 Difference]: Finished difference Result 318 states and 458 transitions. [2018-10-24 02:30:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 02:30:21,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-10-24 02:30:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:21,669 INFO L225 Difference]: With dead ends: 318 [2018-10-24 02:30:21,669 INFO L226 Difference]: Without dead ends: 150 [2018-10-24 02:30:21,670 INFO L605 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-10-24 02:30:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-24 02:30:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-24 02:30:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-24 02:30:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2018-10-24 02:30:21,678 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 50 [2018-10-24 02:30:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:21,678 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2018-10-24 02:30:21,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 02:30:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2018-10-24 02:30:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-24 02:30:21,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:21,679 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-10-24 02:30:21,680 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:21,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-10-24 02:30:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:21,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:21,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:21,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 02:30:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:22,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:30:22,118 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-24 02:30:22,118 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-10-24 02:30:22,121 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:30:22,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:30:22,458 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:30:31,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:30:31,290 INFO L272 AbstractInterpreter]: Visited 39 different actions 211 times. Merged at 32 different actions 142 times. Widened at 3 different actions 6 times. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2018-10-24 02:30:31,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:31,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:30:31,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:31,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:30:31,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:31,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:30:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:31,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:30:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:31,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:30:31,576 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-10-24 02:30:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:31,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 02:30:31,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-10-24 02:30:31,686 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 02:30:31,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 02:30:31,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 02:30:31,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-24 02:30:31,689 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand 9 states. [2018-10-24 02:30:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:30:32,011 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2018-10-24 02:30:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 02:30:32,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-10-24 02:30:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:30:32,013 INFO L225 Difference]: With dead ends: 191 [2018-10-24 02:30:32,014 INFO L226 Difference]: Without dead ends: 187 [2018-10-24 02:30:32,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-24 02:30:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-24 02:30:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2018-10-24 02:30:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-24 02:30:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 258 transitions. [2018-10-24 02:30:32,027 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 258 transitions. Word has length 51 [2018-10-24 02:30:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:30:32,027 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 258 transitions. [2018-10-24 02:30:32,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 02:30:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 258 transitions. [2018-10-24 02:30:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-24 02:30:32,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:30:32,028 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-10-24 02:30:32,028 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:30:32,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:30:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-10-24 02:30:32,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:30:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:32,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:30:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:30:32,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:30:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:30:32,287 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:30:32,453 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:30:32,884 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-24 02:30:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:30:33,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:30:33,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:30:33,080 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-10-24 02:30:33,080 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-10-24 02:30:33,082 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:30:33,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:30:33,415 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 02:32:44,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 02:32:44,744 INFO L272 AbstractInterpreter]: Visited 44 different actions 2796 times. Merged at 37 different actions 2398 times. Widened at 5 different actions 158 times. Found 353 fixpoints after 12 different actions. Largest state had 50 variables. [2018-10-24 02:32:44,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:32:44,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 02:32:44,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:32:44,754 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:32:44,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:32:44,764 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:32:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:32:44,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:32:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:32:45,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 02:32:45,674 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2018-10-24 02:32:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 02:32:45,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 02:32:45,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-10-24 02:32:45,734 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 02:32:45,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 02:32:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 02:32:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-24 02:32:45,735 INFO L87 Difference]: Start difference. First operand 184 states and 258 transitions. Second operand 9 states. [2018-10-24 02:32:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 02:32:46,287 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2018-10-24 02:32:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 02:32:46,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-24 02:32:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 02:32:46,288 INFO L225 Difference]: With dead ends: 188 [2018-10-24 02:32:46,288 INFO L226 Difference]: Without dead ends: 186 [2018-10-24 02:32:46,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-10-24 02:32:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-24 02:32:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-24 02:32:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-24 02:32:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2018-10-24 02:32:46,304 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 61 [2018-10-24 02:32:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 02:32:46,305 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2018-10-24 02:32:46,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 02:32:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2018-10-24 02:32:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-24 02:32:46,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 02:32:46,306 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-10-24 02:32:46,306 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 02:32:46,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 02:32:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-10-24 02:32:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 02:32:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:32:46,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:32:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 02:32:46,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 02:32:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:32:46,605 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:32:46,787 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-24 02:32:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 02:32:46,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:32:46,904 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 02:32:46,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-10-24 02:32:46,904 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-10-24 02:32:46,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 02:32:46,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 02:32:47,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-10-24 02:33:41,644 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-10-24 02:33:41,645 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-10-24 02:33:41,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 02:33:41,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 02:33:41,645 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 02:33:41,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 02:33:41,653 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 02:33:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 02:33:41,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 02:33:41,733 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 02:33:41,933 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 02:33:41,934 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 02:33:41,939 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 02:33:41,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:33:41 BoogieIcfgContainer [2018-10-24 02:33:41,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 02:33:41,941 INFO L168 Benchmark]: Toolchain (without parser) took 251522.96 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 168.9 MB. Max. memory is 7.1 GB. [2018-10-24 02:33:41,942 INFO L168 Benchmark]: CDTParser took 0.21 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-10-24 02:33:41,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.99 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-10-24 02:33:41,943 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.03 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-10-24 02:33:41,943 INFO L168 Benchmark]: Boogie Preprocessor took 167.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.8 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2018-10-24 02:33:41,944 INFO L168 Benchmark]: RCFGBuilder took 1978.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2018-10-24 02:33:41,945 INFO L168 Benchmark]: TraceAbstraction took 248772.24 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 149.8 MB. Max. memory is 7.1 GB. [2018-10-24 02:33:41,949 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 565.99 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 32.03 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.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.8 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1978.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248772.24 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 149.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 7,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. TIMEOUT Result, 248.7s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2265 SDtfs, 1372 SDslu, 3513 SDs, 0 SdLazy, 900 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 604 GetRequests, 524 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 220.2s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.943293885601578 AbsIntWeakeningRatio, 1.7307692307692308 AbsIntAvgWeakeningVarsNumRemoved, 662.5769230769231 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 55 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 992 ConstructedInterpolants, 78 QuantifiedInterpolants, 397393 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1832 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 264/514 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown