java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:01:12,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:01:12,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:01:12,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:01:12,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:01:12,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:01:12,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:01:12,847 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:01:12,849 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:01:12,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:01:12,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:01:12,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:01:12,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:01:12,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:01:12,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:01:12,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:01:12,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:01:12,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:01:12,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:01:12,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:01:12,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:01:12,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:01:12,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:01:12,883 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:01:12,883 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:01:12,884 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:01:12,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:01:12,885 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:01:12,888 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:01:12,889 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:01:12,889 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:01:12,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:01:12,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:01:12,890 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:01:12,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:01:12,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:01:12,895 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:01:12,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:01:12,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:01:12,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:01:12,926 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:01:12,926 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:01:12,926 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:01:12,926 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:01:12,927 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:01:12,927 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:01:12,927 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:01:12,928 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:01:12,928 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:01:12,928 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:01:12,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:01:12,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:01:12,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:01:12,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:01:12,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:01:12,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:01:12,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:01:12,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:01:12,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:01:12,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:01:12,932 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:01:12,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:01:12,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:12,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:01:12,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:01:12,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:01:12,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:01:12,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:01:12,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:01:12,934 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:01:12,934 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:01:12,934 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:01:13,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:01:13,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:01:13,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:01:13,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:01:13,028 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:01:13,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 22:01:13,098 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e789ab3e/b46628165872429d83e7326138d1b67d/FLAG13d5214dc [2018-11-07 22:01:13,552 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:01:13,552 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 22:01:13,560 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e789ab3e/b46628165872429d83e7326138d1b67d/FLAG13d5214dc [2018-11-07 22:01:13,573 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e789ab3e/b46628165872429d83e7326138d1b67d [2018-11-07 22:01:13,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:01:13,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:01:13,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:13,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:01:13,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:01:13,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6bed07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13, skipping insertion in model container [2018-11-07 22:01:13,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:01:13,630 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:01:13,848 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:13,853 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:01:13,894 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:01:13,918 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:01:13,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13 WrapperNode [2018-11-07 22:01:13,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:01:13,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:13,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:01:13,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:01:13,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:01:13,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:01:13,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:01:13,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:01:13,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... [2018-11-07 22:01:13,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:01:13,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:01:13,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:01:13,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:01:13,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:01:14,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 22:01:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:01:14,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:01:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 22:01:14,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:01:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:01:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:01:14,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:01:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 22:01:14,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:01:14,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:01:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 22:01:14,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 22:01:15,183 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:01:15,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:15 BoogieIcfgContainer [2018-11-07 22:01:15,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:01:15,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:01:15,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:01:15,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:01:15,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:01:13" (1/3) ... [2018-11-07 22:01:15,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666dcb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:15, skipping insertion in model container [2018-11-07 22:01:15,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:01:13" (2/3) ... [2018-11-07 22:01:15,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666dcb79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:01:15, skipping insertion in model container [2018-11-07 22:01:15,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:01:15" (3/3) ... [2018-11-07 22:01:15,193 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-07 22:01:15,204 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:01:15,213 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:01:15,231 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:01:15,268 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:01:15,269 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:01:15,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:01:15,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:01:15,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:01:15,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:01:15,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:01:15,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:01:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-11-07 22:01:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-07 22:01:15,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:15,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:15,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:15,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash 858599657, now seen corresponding path program 1 times [2018-11-07 22:01:15,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:15,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:01:15,649 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:15,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:01:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:01:15,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:01:15,676 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2018-11-07 22:01:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:15,720 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-11-07 22:01:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:01:15,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 84 [2018-11-07 22:01:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:15,732 INFO L225 Difference]: With dead ends: 207 [2018-11-07 22:01:15,733 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 22:01:15,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:01:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 22:01:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-07 22:01:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 22:01:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-11-07 22:01:15,785 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 84 [2018-11-07 22:01:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:15,786 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-07 22:01:15,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:01:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-11-07 22:01:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 22:01:15,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:15,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:15,791 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:15,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1678531354, now seen corresponding path program 1 times [2018-11-07 22:01:15,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:15,793 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:01:16,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:01:16,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 22:01:16,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:16,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:01:16,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:01:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 22:01:16,018 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 4 states. [2018-11-07 22:01:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:16,288 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-07 22:01:16,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:01:16,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-07 22:01:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:16,294 INFO L225 Difference]: With dead ends: 207 [2018-11-07 22:01:16,294 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 22:01:16,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 22:01:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 22:01:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-07 22:01:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 22:01:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-11-07 22:01:16,317 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 87 [2018-11-07 22:01:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:16,318 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-11-07 22:01:16,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:01:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-11-07 22:01:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 22:01:16,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:16,321 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:16,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:16,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1900720706, now seen corresponding path program 1 times [2018-11-07 22:01:16,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:16,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:16,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:16,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:16,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:01:16,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:16,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:16,538 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-07 22:01:16,540 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 22:01:16,581 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:16,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:16,820 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 22:01:16,822 INFO L272 AbstractInterpreter]: Visited 77 different actions 81 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-07 22:01:16,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:16,837 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 22:01:17,182 INFO L227 lantSequenceWeakener]: Weakened 76 states. On average, predicates are now at 64.62% of their original sizes. [2018-11-07 22:01:17,182 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 22:01:17,832 INFO L415 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2018-11-07 22:01:17,832 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 22:01:17,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:01:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 22:01:17,834 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:17,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 22:01:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 22:01:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:01:17,835 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 10 states. [2018-11-07 22:01:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:20,902 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2018-11-07 22:01:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 22:01:20,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-07 22:01:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:20,905 INFO L225 Difference]: With dead ends: 252 [2018-11-07 22:01:20,906 INFO L226 Difference]: Without dead ends: 200 [2018-11-07 22:01:20,907 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-07 22:01:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2018-11-07 22:01:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 22:01:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-11-07 22:01:20,936 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 97 [2018-11-07 22:01:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:20,937 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-11-07 22:01:20,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 22:01:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-11-07 22:01:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 22:01:20,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:20,944 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:20,945 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:20,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1848574906, now seen corresponding path program 1 times [2018-11-07 22:01:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:20,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:20,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:20,948 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:01:21,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:21,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:21,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-11-07 22:01:21,272 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 22:01:21,277 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:21,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:21,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 22:01:21,357 INFO L272 AbstractInterpreter]: Visited 85 different actions 119 times. Merged at 5 different actions 24 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-07 22:01:21,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:21,385 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 22:01:21,497 INFO L227 lantSequenceWeakener]: Weakened 92 states. On average, predicates are now at 39.43% of their original sizes. [2018-11-07 22:01:21,498 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 22:01:22,118 INFO L415 sIntCurrentIteration]: We unified 128 AI predicates to 128 [2018-11-07 22:01:22,118 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 22:01:22,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:01:22,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 22:01:22,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:22,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:01:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:01:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:01:22,121 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 17 states. [2018-11-07 22:01:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:26,553 INFO L93 Difference]: Finished difference Result 311 states and 335 transitions. [2018-11-07 22:01:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:01:26,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2018-11-07 22:01:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:26,556 INFO L225 Difference]: With dead ends: 311 [2018-11-07 22:01:26,556 INFO L226 Difference]: Without dead ends: 225 [2018-11-07 22:01:26,563 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-11-07 22:01:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-07 22:01:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 163. [2018-11-07 22:01:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-07 22:01:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2018-11-07 22:01:26,595 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 129 [2018-11-07 22:01:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:26,596 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2018-11-07 22:01:26,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:01:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2018-11-07 22:01:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 22:01:26,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:26,599 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:26,600 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:26,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 578995617, now seen corresponding path program 1 times [2018-11-07 22:01:26,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:26,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:26,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:26,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:26,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:01:26,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:26,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:26,836 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-07 22:01:26,837 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [110], [111], [112], [113], [114], [115], [116], [117], [126], [128], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 22:01:26,841 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:01:26,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:01:26,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:01:26,974 INFO L272 AbstractInterpreter]: Visited 117 different actions 290 times. Merged at 31 different actions 150 times. Widened at 4 different actions 4 times. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-07 22:01:27,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:27,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:01:27,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:27,003 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:27,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:27,025 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:27,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:01:27,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 22:01:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:27,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-07 22:01:27,455 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 22:01:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 22:01:27,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:01:27,457 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand 9 states. [2018-11-07 22:01:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:28,486 INFO L93 Difference]: Finished difference Result 329 states and 354 transitions. [2018-11-07 22:01:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:01:28,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-07 22:01:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:28,489 INFO L225 Difference]: With dead ends: 329 [2018-11-07 22:01:28,489 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 22:01:28,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 22:01:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 22:01:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2018-11-07 22:01:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-07 22:01:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-11-07 22:01:28,512 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 140 [2018-11-07 22:01:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:28,512 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-11-07 22:01:28,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 22:01:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-11-07 22:01:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-07 22:01:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:28,523 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:28,524 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:28,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1249942257, now seen corresponding path program 2 times [2018-11-07 22:01:28,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:28,529 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-07 22:01:29,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:29,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:29,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:29,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:29,169 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:29,188 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:01:41,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:01:41,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:41,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 22:01:41,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-07 22:01:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 22:01:41,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 11 [2018-11-07 22:01:41,602 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:41,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:01:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:01:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:01:41,603 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 4 states. [2018-11-07 22:01:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:41,733 INFO L93 Difference]: Finished difference Result 292 states and 311 transitions. [2018-11-07 22:01:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:01:41,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-07 22:01:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:41,736 INFO L225 Difference]: With dead ends: 292 [2018-11-07 22:01:41,736 INFO L226 Difference]: Without dead ends: 233 [2018-11-07 22:01:41,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 22:01:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-07 22:01:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 194. [2018-11-07 22:01:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-07 22:01:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 204 transitions. [2018-11-07 22:01:41,750 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 204 transitions. Word has length 150 [2018-11-07 22:01:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:41,751 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 204 transitions. [2018-11-07 22:01:41,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:01:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 204 transitions. [2018-11-07 22:01:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 22:01:41,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:41,755 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:41,755 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:41,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1339962079, now seen corresponding path program 3 times [2018-11-07 22:01:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:41,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:41,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:41,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 22:01:42,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:42,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:42,215 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:42,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:42,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:42,216 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:42,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:01:42,225 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:01:42,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:01:42,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:01:42,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 22:01:42,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-07 22:01:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:01:42,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-11-07 22:01:42,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:01:42,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:01:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:01:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:01:42,555 INFO L87 Difference]: Start difference. First operand 194 states and 204 transitions. Second operand 12 states. [2018-11-07 22:01:43,602 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 22:01:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:44,574 INFO L93 Difference]: Finished difference Result 701 states and 766 transitions. [2018-11-07 22:01:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:01:44,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-11-07 22:01:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:44,578 INFO L225 Difference]: With dead ends: 701 [2018-11-07 22:01:44,578 INFO L226 Difference]: Without dead ends: 444 [2018-11-07 22:01:44,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=476, Invalid=1330, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 22:01:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-07 22:01:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 279. [2018-11-07 22:01:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-07 22:01:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 296 transitions. [2018-11-07 22:01:44,604 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 296 transitions. Word has length 172 [2018-11-07 22:01:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:44,604 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 296 transitions. [2018-11-07 22:01:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:01:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 296 transitions. [2018-11-07 22:01:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 22:01:44,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:44,608 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:44,609 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:44,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1987034330, now seen corresponding path program 4 times [2018-11-07 22:01:44,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:44,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:44,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:01:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:44,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:45,239 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-07 22:01:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2018-11-07 22:01:45,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:45,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:45,346 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:45,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:45,346 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:45,356 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:01:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:45,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:01:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-11-07 22:01:45,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:01:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-11-07 22:01:45,788 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:01:45,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 15 [2018-11-07 22:01:45,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:01:45,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:01:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:01:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:45,789 INFO L87 Difference]: Start difference. First operand 279 states and 296 transitions. Second operand 6 states. [2018-11-07 22:01:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:01:46,148 INFO L93 Difference]: Finished difference Result 486 states and 521 transitions. [2018-11-07 22:01:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:01:46,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2018-11-07 22:01:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:01:46,151 INFO L225 Difference]: With dead ends: 486 [2018-11-07 22:01:46,151 INFO L226 Difference]: Without dead ends: 295 [2018-11-07 22:01:46,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 22:01:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-07 22:01:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 274. [2018-11-07 22:01:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 22:01:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 289 transitions. [2018-11-07 22:01:46,168 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 289 transitions. Word has length 237 [2018-11-07 22:01:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:01:46,168 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 289 transitions. [2018-11-07 22:01:46,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:01:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 289 transitions. [2018-11-07 22:01:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 22:01:46,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:01:46,171 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:01:46,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:01:46,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:01:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1037656774, now seen corresponding path program 5 times [2018-11-07 22:01:46,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:01:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:01:46,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:01:46,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:01:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:01:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2018-11-07 22:01:46,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:46,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:01:46,543 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:01:46,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:01:46,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:01:46,544 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:01:46,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:01:46,552 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:02:05,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:02:05,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:02:05,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 22:02:05,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 22:02:05,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:05,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2018-11-07 22:02:05,986 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:05,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:02:05,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:02:05,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:02:05,988 INFO L87 Difference]: Start difference. First operand 274 states and 289 transitions. Second operand 12 states. [2018-11-07 22:02:06,182 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-11-07 22:02:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:06,517 INFO L93 Difference]: Finished difference Result 565 states and 606 transitions. [2018-11-07 22:02:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:02:06,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 237 [2018-11-07 22:02:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:06,521 INFO L225 Difference]: With dead ends: 565 [2018-11-07 22:02:06,521 INFO L226 Difference]: Without dead ends: 384 [2018-11-07 22:02:06,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-07 22:02:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-07 22:02:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 325. [2018-11-07 22:02:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-07 22:02:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 343 transitions. [2018-11-07 22:02:06,542 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 343 transitions. Word has length 237 [2018-11-07 22:02:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:06,542 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 343 transitions. [2018-11-07 22:02:06,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:02:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 343 transitions. [2018-11-07 22:02:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-11-07 22:02:06,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:06,546 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:06,547 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:06,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:06,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1240309558, now seen corresponding path program 6 times [2018-11-07 22:02:06,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:06,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:02:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:06,548 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 226 proven. 15 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2018-11-07 22:02:06,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:06,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:06,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:06,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:06,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:06,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:06,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:02:06,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:02:06,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:02:06,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:02:06,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 49 proven. 231 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-07 22:02:07,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 49 proven. 231 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-07 22:02:07,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:07,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2018-11-07 22:02:07,287 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:07,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:02:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:02:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:02:07,288 INFO L87 Difference]: Start difference. First operand 325 states and 343 transitions. Second operand 13 states. [2018-11-07 22:02:07,677 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-07 22:02:08,102 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-07 22:02:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:08,269 INFO L93 Difference]: Finished difference Result 657 states and 704 transitions. [2018-11-07 22:02:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:02:08,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2018-11-07 22:02:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:08,273 INFO L225 Difference]: With dead ends: 657 [2018-11-07 22:02:08,274 INFO L226 Difference]: Without dead ends: 465 [2018-11-07 22:02:08,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 547 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-07 22:02:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-11-07 22:02:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 400. [2018-11-07 22:02:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-07 22:02:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 423 transitions. [2018-11-07 22:02:08,305 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 423 transitions. Word has length 280 [2018-11-07 22:02:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:08,305 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 423 transitions. [2018-11-07 22:02:08,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:02:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 423 transitions. [2018-11-07 22:02:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-11-07 22:02:08,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:08,308 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:08,308 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:08,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:08,309 INFO L82 PathProgramCache]: Analyzing trace with hash -454104267, now seen corresponding path program 7 times [2018-11-07 22:02:08,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:08,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:02:08,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:08,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 22:02:08,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:08,615 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:08,615 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:08,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:08,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:08,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:08,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:08,626 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:02:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:08,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 22:02:08,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2018-11-07 22:02:09,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:09,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-07 22:02:09,165 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:09,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 22:02:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 22:02:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:02:09,166 INFO L87 Difference]: Start difference. First operand 400 states and 423 transitions. Second operand 11 states. [2018-11-07 22:02:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:09,302 INFO L93 Difference]: Finished difference Result 792 states and 848 transitions. [2018-11-07 22:02:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 22:02:09,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 335 [2018-11-07 22:02:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:09,305 INFO L225 Difference]: With dead ends: 792 [2018-11-07 22:02:09,305 INFO L226 Difference]: Without dead ends: 540 [2018-11-07 22:02:09,307 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 22:02:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-11-07 22:02:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 475. [2018-11-07 22:02:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-11-07 22:02:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 503 transitions. [2018-11-07 22:02:09,333 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 503 transitions. Word has length 335 [2018-11-07 22:02:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:09,333 INFO L480 AbstractCegarLoop]: Abstraction has 475 states and 503 transitions. [2018-11-07 22:02:09,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 22:02:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 503 transitions. [2018-11-07 22:02:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-11-07 22:02:09,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:09,336 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:09,336 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:09,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1945752214, now seen corresponding path program 8 times [2018-11-07 22:02:09,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:09,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 786 proven. 74 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2018-11-07 22:02:10,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:10,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:10,019 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:10,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:10,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:10,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:10,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:02:10,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:02:40,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 22:02:40,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:02:40,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 22:02:40,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2445 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 22:02:40,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:40,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2018-11-07 22:02:40,718 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:40,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 22:02:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 22:02:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-07 22:02:40,720 INFO L87 Difference]: Start difference. First operand 475 states and 503 transitions. Second operand 12 states. [2018-11-07 22:02:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:41,885 INFO L93 Difference]: Finished difference Result 971 states and 1041 transitions. [2018-11-07 22:02:41,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 22:02:41,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 390 [2018-11-07 22:02:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:41,888 INFO L225 Difference]: With dead ends: 971 [2018-11-07 22:02:41,888 INFO L226 Difference]: Without dead ends: 659 [2018-11-07 22:02:41,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2018-11-07 22:02:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-07 22:02:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 561. [2018-11-07 22:02:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-07 22:02:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 594 transitions. [2018-11-07 22:02:41,918 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 594 transitions. Word has length 390 [2018-11-07 22:02:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:41,918 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 594 transitions. [2018-11-07 22:02:41,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 22:02:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 594 transitions. [2018-11-07 22:02:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-11-07 22:02:41,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:41,922 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:41,922 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:41,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1620014963, now seen corresponding path program 9 times [2018-11-07 22:02:41,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:41,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:02:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:41,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 1198 proven. 120 refuted. 0 times theorem prover too weak. 2422 trivial. 0 not checked. [2018-11-07 22:02:42,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:42,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:42,947 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:42,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:42,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:42,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:02:42,964 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:02:43,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:02:43,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:02:43,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 84 proven. 1080 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2018-11-07 22:02:43,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:43,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 84 proven. 1080 refuted. 0 times theorem prover too weak. 2576 trivial. 0 not checked. [2018-11-07 22:02:43,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:43,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 25 [2018-11-07 22:02:43,863 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:43,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 22:02:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 22:02:43,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:02:43,865 INFO L87 Difference]: Start difference. First operand 561 states and 594 transitions. Second operand 20 states. [2018-11-07 22:02:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:45,646 INFO L93 Difference]: Finished difference Result 1243 states and 1332 transitions. [2018-11-07 22:02:45,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 22:02:45,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 456 [2018-11-07 22:02:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:45,651 INFO L225 Difference]: With dead ends: 1243 [2018-11-07 22:02:45,652 INFO L226 Difference]: Without dead ends: 860 [2018-11-07 22:02:45,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 896 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1167, Invalid=3803, Unknown=0, NotChecked=0, Total=4970 [2018-11-07 22:02:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-11-07 22:02:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 647. [2018-11-07 22:02:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-11-07 22:02:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 685 transitions. [2018-11-07 22:02:45,687 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 685 transitions. Word has length 456 [2018-11-07 22:02:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:45,688 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 685 transitions. [2018-11-07 22:02:45,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 22:02:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 685 transitions. [2018-11-07 22:02:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-11-07 22:02:45,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:45,692 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:45,692 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:45,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash 480769418, now seen corresponding path program 10 times [2018-11-07 22:02:45,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:45,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:02:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:45,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 22:02:46,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:46,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:46,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:46,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:46,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:46,884 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:46,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:46,893 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:02:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:47,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:02:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 22:02:47,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:02:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 22:02:47,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:02:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-11-07 22:02:47,873 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:02:47,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:02:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:02:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:02:47,875 INFO L87 Difference]: Start difference. First operand 647 states and 685 transitions. Second operand 17 states. [2018-11-07 22:02:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:02:48,049 INFO L93 Difference]: Finished difference Result 1241 states and 1324 transitions. [2018-11-07 22:02:48,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 22:02:48,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 522 [2018-11-07 22:02:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:02:48,052 INFO L225 Difference]: With dead ends: 1241 [2018-11-07 22:02:48,053 INFO L226 Difference]: Without dead ends: 787 [2018-11-07 22:02:48,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1030 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 22:02:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-07 22:02:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 722. [2018-11-07 22:02:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-11-07 22:02:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 765 transitions. [2018-11-07 22:02:48,091 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 765 transitions. Word has length 522 [2018-11-07 22:02:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:02:48,091 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 765 transitions. [2018-11-07 22:02:48,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:02:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 765 transitions. [2018-11-07 22:02:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-11-07 22:02:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:02:48,097 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:02:48,097 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:02:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:02:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 922252597, now seen corresponding path program 11 times [2018-11-07 22:02:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:02:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:02:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:02:48,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:02:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:02:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 2286 proven. 245 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2018-11-07 22:02:48,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:48,583 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:02:48,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:02:48,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:02:48,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:02:48,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:02:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:02:48,593 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:03:21,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:03:21,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 22:03:23,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 22:03:23,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-11-07 22:03:23,993 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:23,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 22:03:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 22:03:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:03:23,996 INFO L87 Difference]: Start difference. First operand 722 states and 765 transitions. Second operand 17 states. [2018-11-07 22:03:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:26,046 INFO L93 Difference]: Finished difference Result 1716 states and 1839 transitions. [2018-11-07 22:03:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 22:03:26,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 577 [2018-11-07 22:03:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:26,052 INFO L225 Difference]: With dead ends: 1716 [2018-11-07 22:03:26,052 INFO L226 Difference]: Without dead ends: 1202 [2018-11-07 22:03:26,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1142 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2020, Invalid=4142, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 22:03:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-11-07 22:03:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 808. [2018-11-07 22:03:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-11-07 22:03:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 856 transitions. [2018-11-07 22:03:26,097 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 856 transitions. Word has length 577 [2018-11-07 22:03:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:26,097 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 856 transitions. [2018-11-07 22:03:26,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 22:03:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 856 transitions. [2018-11-07 22:03:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2018-11-07 22:03:26,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:26,104 INFO L375 BasicCegarLoop]: trace histogram [45, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:26,104 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 319324606, now seen corresponding path program 12 times [2018-11-07 22:03:26,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:26,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:26,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:26,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 2962 proven. 324 refuted. 0 times theorem prover too weak. 5987 trivial. 0 not checked. [2018-11-07 22:03:26,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:26,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:26,792 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:26,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:26,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:26,793 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:26,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:03:26,802 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:03:26,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:03:26,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:03:26,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 22:03:27,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 22:03:28,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:28,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 37 [2018-11-07 22:03:28,544 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:28,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 22:03:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 22:03:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 22:03:28,546 INFO L87 Difference]: Start difference. First operand 808 states and 856 transitions. Second operand 28 states. [2018-11-07 22:03:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:31,832 INFO L93 Difference]: Finished difference Result 2069 states and 2218 transitions. [2018-11-07 22:03:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-07 22:03:31,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 643 [2018-11-07 22:03:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:31,842 INFO L225 Difference]: With dead ends: 2069 [2018-11-07 22:03:31,842 INFO L226 Difference]: Without dead ends: 1484 [2018-11-07 22:03:31,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1262 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3045, Invalid=11961, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 22:03:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2018-11-07 22:03:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 894. [2018-11-07 22:03:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-11-07 22:03:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 947 transitions. [2018-11-07 22:03:31,902 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 947 transitions. Word has length 643 [2018-11-07 22:03:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:31,903 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 947 transitions. [2018-11-07 22:03:31,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 22:03:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 947 transitions. [2018-11-07 22:03:31,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-11-07 22:03:31,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:31,911 INFO L375 BasicCegarLoop]: trace histogram [50, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:31,911 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:31,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:31,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1758994133, now seen corresponding path program 13 times [2018-11-07 22:03:31,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:31,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:03:31,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:31,915 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 22:03:32,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:32,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:32,924 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:32,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:32,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:32,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:32,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:32,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:03:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:33,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:03:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 22:03:33,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:03:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 22:03:34,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:03:34,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2018-11-07 22:03:34,167 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:03:34,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:03:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:03:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:03:34,169 INFO L87 Difference]: Start difference. First operand 894 states and 947 transitions. Second operand 23 states. [2018-11-07 22:03:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:03:34,449 INFO L93 Difference]: Finished difference Result 1690 states and 1800 transitions. [2018-11-07 22:03:34,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:03:34,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 709 [2018-11-07 22:03:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:03:34,454 INFO L225 Difference]: With dead ends: 1690 [2018-11-07 22:03:34,454 INFO L226 Difference]: Without dead ends: 1034 [2018-11-07 22:03:34,455 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1430 GetRequests, 1398 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 22:03:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-11-07 22:03:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 969. [2018-11-07 22:03:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2018-11-07 22:03:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1027 transitions. [2018-11-07 22:03:34,501 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1027 transitions. Word has length 709 [2018-11-07 22:03:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:03:34,502 INFO L480 AbstractCegarLoop]: Abstraction has 969 states and 1027 transitions. [2018-11-07 22:03:34,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:03:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1027 transitions. [2018-11-07 22:03:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2018-11-07 22:03:34,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:03:34,509 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:03:34,509 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:03:34,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:03:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -780359094, now seen corresponding path program 14 times [2018-11-07 22:03:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:03:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:34,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:03:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:03:34,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:03:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:03:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 4578 proven. 515 refuted. 0 times theorem prover too weak. 9243 trivial. 0 not checked. [2018-11-07 22:03:35,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:35,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:03:35,092 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:03:35,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:03:35,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:03:35,092 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:03:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:03:35,101 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:04:14,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:04:14,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:04:14,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:04:15,149 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 22:04:15,494 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 22:04:15,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-07 22:04:15,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 22:04:15,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:15,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:15,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:15,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-07 22:04:16,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-07 22:04:16,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:16,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 22:04:16,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:16,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:16,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:16,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-07 22:04:16,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 22:04:16,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:16,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2018-11-07 22:04:16,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:16,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:04:16,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:04:16,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:75 [2018-11-07 22:04:16,552 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-07 22:04:16,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-11-07 22:04:16,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:16,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 65 [2018-11-07 22:04:16,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-07 22:04:16,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:04:16,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-11-07 22:04:16,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:16,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-07 22:04:16,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:16,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:16,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-07 22:04:16,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2018-11-07 22:04:17,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2018-11-07 22:04:17,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 67 [2018-11-07 22:04:17,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:17,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:17,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-11-07 22:04:17,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:17,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 67 [2018-11-07 22:04:17,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:17,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:17,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:04:17,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:125 [2018-11-07 22:04:19,110 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-07 22:04:19,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2018-11-07 22:04:19,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:19,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:19,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:19,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:19,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:19,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2018-11-07 22:04:19,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:19,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:19,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 22:04:19,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:3 [2018-11-07 22:04:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-11-07 22:04:23,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:04:35,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-07 22:04:35,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-11-07 22:04:35,723 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:35,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-11-07 22:04:35,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:35,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 79 [2018-11-07 22:04:35,778 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:35,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-11-07 22:04:35,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:35,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-11-07 22:04:35,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:35,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2018-11-07 22:04:36,010 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:36,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 22:04:36,079 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 98 [2018-11-07 22:04:36,378 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2018-11-07 22:04:36,397 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 22:04:36,397 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:36,419 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,427 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,430 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 22:04:36,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-07 22:04:36,434 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:36,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 104 [2018-11-07 22:04:36,675 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-07 22:04:36,748 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-11-07 22:04:36,751 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-07 22:04:36,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 22:04:36,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 81 [2018-11-07 22:04:36,878 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-07 22:04:36,967 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 22:04:37,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:04:37,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:04:37,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:04:37,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 22:04:37,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-11-07 22:04:37,358 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:67, output treesize:146 [2018-11-07 22:04:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2018-11-07 22:04:38,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:04:38,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 20] total 50 [2018-11-07 22:04:38,937 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:04:38,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:04:38,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:04:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2118, Unknown=6, NotChecked=0, Total=2450 [2018-11-07 22:04:38,939 INFO L87 Difference]: Start difference. First operand 969 states and 1027 transitions. Second operand 33 states. [2018-11-07 22:04:41,308 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2018-11-07 22:04:41,574 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2018-11-07 22:04:42,038 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-11-07 22:04:45,937 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-11-07 22:04:49,154 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-07 22:04:49,781 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-11-07 22:04:54,150 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-07 22:04:58,291 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-07 22:05:02,469 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:06,608 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:10,912 WARN L179 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:15,065 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:19,230 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:23,411 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-07 22:05:27,611 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 Received shutdown request... [2018-11-07 22:05:31,798 WARN L187 SmtUtils]: Removed 6 from assertion stack [2018-11-07 22:05:31,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-07 22:05:31,799 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 22:05:31,805 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 22:05:31,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:05:31 BoogieIcfgContainer [2018-11-07 22:05:31,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:05:31,806 INFO L168 Benchmark]: Toolchain (without parser) took 258220.87 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 879.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:31,807 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:05:31,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.29 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:31,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:05:31,808 INFO L168 Benchmark]: Boogie Preprocessor took 45.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:05:31,808 INFO L168 Benchmark]: RCFGBuilder took 1188.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:31,809 INFO L168 Benchmark]: TraceAbstraction took 256619.68 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -265.5 MB). Peak memory consumption was 881.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:05:31,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.29 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.87 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 45.08 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. * RCFGBuilder took 1188.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256619.68 ms. Allocated memory was 2.3 GB in the beginning and 3.5 GB in the end (delta: 1.1 GB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -265.5 MB). Peak memory consumption was 881.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (969states) and FLOYD_HOARE automaton (currently 82 states, 33 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. TIMEOUT Result, 256.5s OverallTime, 18 OverallIterations, 55 TraceHistogramMax, 74.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2077 SDtfs, 22013 SDslu, 13115 SDs, 0 SdLazy, 5693 SolverSat, 1812 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 11923 GetRequests, 11256 SyntacticMatches, 22 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13724 ImplicationChecksByTransitivity, 78.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=969occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.9857751725398786 AbsIntWeakeningRatio, 0.32589285714285715 AbsIntAvgWeakeningVarsNumRemoved, 4.620535714285714 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 2039 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 135.1s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 11621 NumberOfCodeBlocks, 10209 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 17187 ConstructedInterpolants, 677 QuantifiedInterpolants, 57198952 SizeOfPredicates, 51 NumberOfNonLiveVariables, 7170 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 46 InterpolantComputations, 5 PerfectInterpolantSequences, 159697/171873 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown