java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:37:52,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:37:52,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:37:52,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:37:52,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:37:52,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:37:52,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:37:52,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:37:52,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:37:52,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:37:52,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:37:52,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:37:52,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:37:52,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:37:52,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:37:52,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:37:52,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:37:52,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:37:52,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:37:52,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:37:52,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:37:52,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:37:52,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:37:52,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:37:52,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:37:52,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:37:52,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:37:52,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:37:52,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:37:52,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:37:52,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:37:52,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:37:52,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:37:52,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:37:52,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:37:52,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:37:52,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:37:52,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:37:52,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:37:52,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:37:52,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:37:52,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:37:52,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:37:52,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:37:52,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:37:52,374 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:37:52,375 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:37:52,375 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:37:52,375 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:37:52,375 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:37:52,376 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:37:52,376 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:37:52,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:37:52,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:37:52,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:37:52,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:37:52,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:37:52,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:37:52,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:37:52,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:37:52,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:37:52,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:37:52,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:37:52,379 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:37:52,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:37:52,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:37:52,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:37:52,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:37:52,380 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:37:52,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:37:52,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:37:52,380 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:37:52,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:37:52,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:37:52,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:37:52,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:37:52,439 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:37:52,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2019-09-10 01:37:52,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d49ba43/ba189164783d4ec0b7a80f5e71682978/FLAGb4d5d9834 [2019-09-10 01:37:52,982 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:37:52,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2019-09-10 01:37:52,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d49ba43/ba189164783d4ec0b7a80f5e71682978/FLAGb4d5d9834 [2019-09-10 01:37:53,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d49ba43/ba189164783d4ec0b7a80f5e71682978 [2019-09-10 01:37:53,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:37:53,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:37:53,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:37:53,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:37:53,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:37:53,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b0c836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53, skipping insertion in model container [2019-09-10 01:37:53,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:37:53,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:37:53,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:37:53,631 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:37:53,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:37:53,755 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:37:53,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53 WrapperNode [2019-09-10 01:37:53,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:37:53,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:37:53,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:37:53,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:37:53,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... [2019-09-10 01:37:53,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:37:53,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:37:53,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:37:53,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:37:53,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:37:53,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:37:53,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:37:53,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:37:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:37:54,066 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:37:54,067 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:37:54,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:37:54 BoogieIcfgContainer [2019-09-10 01:37:54,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:37:54,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:37:54,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:37:54,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:37:54,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:37:53" (1/3) ... [2019-09-10 01:37:54,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f2d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:37:54, skipping insertion in model container [2019-09-10 01:37:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:37:53" (2/3) ... [2019-09-10 01:37:54,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f2d805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:37:54, skipping insertion in model container [2019-09-10 01:37:54,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:37:54" (3/3) ... [2019-09-10 01:37:54,094 INFO L109 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2019-09-10 01:37:54,121 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:37:54,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:37:54,160 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:37:54,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:37:54,190 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:37:54,191 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:37:54,191 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:37:54,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:37:54,191 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:37:54,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:37:54,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:37:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-10 01:37:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:37:54,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:54,214 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:54,216 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1812149672, now seen corresponding path program 1 times [2019-09-10 01:37:54,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:54,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:54,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:54,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:54,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:37:54,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:54,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:37:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:37:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:37:54,366 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-09-10 01:37:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:54,416 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2019-09-10 01:37:54,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:37:54,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-10 01:37:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:54,427 INFO L225 Difference]: With dead ends: 32 [2019-09-10 01:37:54,427 INFO L226 Difference]: Without dead ends: 24 [2019-09-10 01:37:54,429 INFO L628 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 [2019-09-10 01:37:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-10 01:37:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-10 01:37:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-10 01:37:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-10 01:37:54,466 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2019-09-10 01:37:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:54,467 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-10 01:37:54,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:37:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-10 01:37:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:37:54,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:54,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:54,469 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -75160477, now seen corresponding path program 1 times [2019-09-10 01:37:54,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:54,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:54,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:54,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:37:54,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:37:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:37:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:37:54,537 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-09-10 01:37:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:54,551 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-09-10 01:37:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:37:54,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-10 01:37:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:54,553 INFO L225 Difference]: With dead ends: 25 [2019-09-10 01:37:54,553 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 01:37:54,554 INFO L628 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 [2019-09-10 01:37:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 01:37:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 01:37:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:37:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 01:37:54,559 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2019-09-10 01:37:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:54,559 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 01:37:54,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:37:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 01:37:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:37:54,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:54,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:54,561 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1465715112, now seen corresponding path program 1 times [2019-09-10 01:37:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:54,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:54,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:37:54,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:54,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:37:54,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:37:54,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:37:54,633 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-09-10 01:37:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:54,675 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-09-10 01:37:54,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:37:54,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 01:37:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:54,677 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:37:54,677 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:37:54,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:37:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2019-09-10 01:37:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-10 01:37:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-10 01:37:54,684 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2019-09-10 01:37:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:54,684 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-10 01:37:54,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:37:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-10 01:37:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:37:54,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:54,685 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:54,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1481772461, now seen corresponding path program 1 times [2019-09-10 01:37:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:54,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:37:54,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:54,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:37:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:37:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:54,741 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-09-10 01:37:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:54,853 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-10 01:37:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:37:54,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 01:37:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:54,855 INFO L225 Difference]: With dead ends: 49 [2019-09-10 01:37:54,856 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 01:37:54,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:37:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 01:37:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2019-09-10 01:37:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:37:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-10 01:37:54,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2019-09-10 01:37:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:54,862 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-10 01:37:54,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:37:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-10 01:37:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:37:54,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:54,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:54,864 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:54,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1797941532, now seen corresponding path program 1 times [2019-09-10 01:37:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:54,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:54,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:54,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:54,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:37:54,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:54,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:37:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:37:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:54,925 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2019-09-10 01:37:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:55,012 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-09-10 01:37:55,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:37:55,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:37:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:55,015 INFO L225 Difference]: With dead ends: 65 [2019-09-10 01:37:55,015 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 01:37:55,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:37:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 01:37:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2019-09-10 01:37:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 01:37:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-09-10 01:37:55,024 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 21 [2019-09-10 01:37:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:55,024 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-09-10 01:37:55,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:37:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-09-10 01:37:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:37:55,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:55,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:55,026 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2005363020, now seen corresponding path program 1 times [2019-09-10 01:37:55,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:55,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:55,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:37:55,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:55,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:37:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:37:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:55,073 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 5 states. [2019-09-10 01:37:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:55,167 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2019-09-10 01:37:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:37:55,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-10 01:37:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:55,169 INFO L225 Difference]: With dead ends: 85 [2019-09-10 01:37:55,169 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 01:37:55,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:37:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 01:37:55,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2019-09-10 01:37:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 01:37:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-09-10 01:37:55,178 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 21 [2019-09-10 01:37:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:55,179 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-09-10 01:37:55,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:37:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-09-10 01:37:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:37:55,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:55,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:55,181 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1548463909, now seen corresponding path program 1 times [2019-09-10 01:37:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:55,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:55,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:55,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:37:55,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:55,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:37:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:37:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:37:55,247 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 6 states. [2019-09-10 01:37:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:55,369 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-09-10 01:37:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:37:55,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-10 01:37:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:55,374 INFO L225 Difference]: With dead ends: 125 [2019-09-10 01:37:55,374 INFO L226 Difference]: Without dead ends: 125 [2019-09-10 01:37:55,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:37:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-10 01:37:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 81. [2019-09-10 01:37:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-10 01:37:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2019-09-10 01:37:55,394 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 22 [2019-09-10 01:37:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:55,394 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2019-09-10 01:37:55,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:37:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2019-09-10 01:37:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:37:55,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:55,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:55,396 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 739117283, now seen corresponding path program 1 times [2019-09-10 01:37:55,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:55,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:55,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:55,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:55,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:37:55,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:55,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:37:55,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:37:55,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:37:55,438 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand 4 states. [2019-09-10 01:37:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:55,470 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-09-10 01:37:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:37:55,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 01:37:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:55,471 INFO L225 Difference]: With dead ends: 95 [2019-09-10 01:37:55,471 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 01:37:55,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 01:37:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2019-09-10 01:37:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-10 01:37:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-09-10 01:37:55,479 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 22 [2019-09-10 01:37:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:55,480 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-09-10 01:37:55,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:37:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-09-10 01:37:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 01:37:55,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:55,483 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:55,483 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1013722536, now seen corresponding path program 1 times [2019-09-10 01:37:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:55,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 01:37:55,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:55,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:37:55,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-10 01:37:55,569 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [15], [19], [22], [25], [29], [32], [34], [37], [40], [42], [45], [46], [48], [52], [54], [56], [59], [79], [80], [81] [2019-09-10 01:37:55,602 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:37:55,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:37:55,670 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:37:55,674 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:37:55,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:37:55,817 INFO L272 AbstractInterpreter]: Visited 25 different actions 148 times. Merged at 19 different actions 109 times. Widened at 6 different actions 12 times. Performed 408 root evaluator evaluations with a maximum evaluation depth of 3. Performed 408 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 7 different actions. Largest state had 15 variables. [2019-09-10 01:37:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:55,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:37:55,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:55,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:37:55,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:55,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:37:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:55,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:37:55,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:37:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 01:37:56,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:37:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 01:37:56,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:37:56,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2019-09-10 01:37:56,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:37:56,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:37:56,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:37:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:37:56,152 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 13 states. [2019-09-10 01:37:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:57,023 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2019-09-10 01:37:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 01:37:57,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-09-10 01:37:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:57,025 INFO L225 Difference]: With dead ends: 156 [2019-09-10 01:37:57,025 INFO L226 Difference]: Without dead ends: 156 [2019-09-10 01:37:57,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=481, Invalid=1159, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 01:37:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-10 01:37:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 50. [2019-09-10 01:37:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:37:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-09-10 01:37:57,031 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 34 [2019-09-10 01:37:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:57,032 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-09-10 01:37:57,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:37:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-09-10 01:37:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:37:57,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:57,033 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:57,033 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1848875111, now seen corresponding path program 1 times [2019-09-10 01:37:57,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:57,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:37:57,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:57,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:37:57,145 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2019-09-10 01:37:57,146 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [15], [19], [22], [25], [29], [32], [34], [37], [40], [42], [45], [46], [48], [50], [52], [56], [59], [79], [80], [81] [2019-09-10 01:37:57,150 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:37:57,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:37:57,159 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:37:57,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:37:57,287 INFO L272 AbstractInterpreter]: Visited 25 different actions 163 times. Merged at 19 different actions 122 times. Widened at 7 different actions 17 times. Performed 446 root evaluator evaluations with a maximum evaluation depth of 3. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 18 fixpoints after 8 different actions. Largest state had 15 variables. [2019-09-10 01:37:57,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:57,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:37:57,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:57,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:37:57,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:57,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:37:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:57,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:37:57,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:37:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:37:57,384 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:37:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 01:37:57,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:37:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2019-09-10 01:37:57,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:37:57,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 01:37:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 01:37:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:37:57,497 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 12 states. [2019-09-10 01:37:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:57,620 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-09-10 01:37:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:37:57,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-09-10 01:37:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:57,622 INFO L225 Difference]: With dead ends: 72 [2019-09-10 01:37:57,622 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 01:37:57,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-09-10 01:37:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 01:37:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 42. [2019-09-10 01:37:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:37:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-10 01:37:57,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 35 [2019-09-10 01:37:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:57,627 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-10 01:37:57,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 01:37:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-10 01:37:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-10 01:37:57,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:57,628 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:57,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:57,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1922885297, now seen corresponding path program 2 times [2019-09-10 01:37:57,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:57,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:57,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:37:57,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:57,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:37:57,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:37:57,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:57,674 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2019-09-10 01:37:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:57,725 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-09-10 01:37:57,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:37:57,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-09-10 01:37:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:57,728 INFO L225 Difference]: With dead ends: 70 [2019-09-10 01:37:57,728 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 01:37:57,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:37:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 01:37:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2019-09-10 01:37:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 01:37:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-09-10 01:37:57,735 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 35 [2019-09-10 01:37:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-09-10 01:37:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:37:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-09-10 01:37:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:37:57,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:57,740 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:57,740 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1970174490, now seen corresponding path program 1 times [2019-09-10 01:37:57,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:37:57,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:57,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:57,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:57,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:37:57,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2019-09-10 01:37:57,844 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [15], [19], [22], [25], [29], [34], [37], [40], [42], [45], [46], [48], [50], [52], [56], [59], [79], [80], [81] [2019-09-10 01:37:57,847 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:37:57,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:37:57,852 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:37:57,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:37:57,889 INFO L272 AbstractInterpreter]: Visited 24 different actions 126 times. Merged at 18 different actions 95 times. Widened at 5 different actions 9 times. Performed 356 root evaluator evaluations with a maximum evaluation depth of 3. Performed 356 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 4 different actions. Largest state had 15 variables. [2019-09-10 01:37:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:57,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:37:57,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:37:57,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:37:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:57,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:37:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:57,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 01:37:57,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:37:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:57,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:37:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:37:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 01:37:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2019-09-10 01:37:58,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:37:58,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:37:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:37:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-09-10 01:37:58,107 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 13 states. [2019-09-10 01:37:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:58,223 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2019-09-10 01:37:58,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:37:58,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-09-10 01:37:58,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:58,226 INFO L225 Difference]: With dead ends: 109 [2019-09-10 01:37:58,226 INFO L226 Difference]: Without dead ends: 109 [2019-09-10 01:37:58,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-09-10 01:37:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-10 01:37:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2019-09-10 01:37:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 01:37:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-09-10 01:37:58,231 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 36 [2019-09-10 01:37:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:58,231 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-09-10 01:37:58,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:37:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-09-10 01:37:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-10 01:37:58,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:37:58,233 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:37:58,233 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:37:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:37:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2105938088, now seen corresponding path program 1 times [2019-09-10 01:37:58,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:37:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:37:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:37:58,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:37:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:37:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 01:37:58,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:37:58,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:37:58,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:37:58,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:37:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:37:58,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:37:58,266 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 5 states. [2019-09-10 01:37:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:37:58,315 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2019-09-10 01:37:58,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:37:58,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-10 01:37:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:37:58,316 INFO L225 Difference]: With dead ends: 71 [2019-09-10 01:37:58,316 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:37:58,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:37:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:37:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:37:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:37:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:37:58,317 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-09-10 01:37:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:37:58,317 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:37:58,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:37:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:37:58,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:37:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:37:58 BoogieIcfgContainer [2019-09-10 01:37:58,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:37:58,326 INFO L168 Benchmark]: Toolchain (without parser) took 4949.49 ms. Allocated memory was 135.8 MB in the beginning and 252.7 MB in the end (delta: 116.9 MB). Free memory was 90.5 MB in the beginning and 122.9 MB in the end (delta: -32.4 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,327 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.93 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 179.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,329 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 177.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,330 INFO L168 Benchmark]: RCFGBuilder took 283.87 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 163.6 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,330 INFO L168 Benchmark]: TraceAbstraction took 4252.71 ms. Allocated memory was 201.9 MB in the beginning and 252.7 MB in the end (delta: 50.9 MB). Free memory was 163.1 MB in the beginning and 122.9 MB in the end (delta: 40.2 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:37:58,334 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.93 ms. Allocated memory was 135.8 MB in the beginning and 201.9 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 179.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.12 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 177.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 283.87 ms. Allocated memory is still 201.9 MB. Free memory was 177.5 MB in the beginning and 163.6 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4252.71 ms. Allocated memory was 201.9 MB in the beginning and 252.7 MB in the end (delta: 50.9 MB). Free memory was 163.1 MB in the beginning and 122.9 MB in the end (delta: 40.2 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 61]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 4.1s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 756 SDslu, 784 SDs, 0 SdLazy, 603 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 328 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 447 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 43708 SizeOfPredicates, 24 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 70/144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...