java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:16:38,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:16:38,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:16:38,641 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:16:38,641 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:16:38,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:16:38,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:16:38,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:16:38,647 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:16:38,648 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:16:38,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:16:38,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:16:38,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:16:38,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:16:38,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:16:38,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:16:38,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:16:38,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:16:38,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:16:38,660 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:16:38,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:16:38,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:16:38,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:16:38,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:16:38,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:16:38,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:16:38,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:16:38,667 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:16:38,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:16:38,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:16:38,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:16:38,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:16:38,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:16:38,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:16:38,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:16:38,679 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:16:38,680 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:16:38,680 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:16:38,680 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:16:38,680 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:16:38,681 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:16:38,681 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:16:38,681 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:16:38,681 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:16:38,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:16:38,682 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:16:38,682 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:16:38,682 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:16:38,682 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:16:38,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:16:38,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:16:38,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:16:38,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:16:38,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:16:38,684 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:16:38,684 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:16:38,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:16:38,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:16:38,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:16:38,686 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:16:38,686 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:16:38,687 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:16:38,687 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:16:38,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:16:38,735 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:16:38,739 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:16:38,740 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:16:38,741 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:16:38,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:16:38,907 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:16:38,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:16:38,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:16:38,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:16:38,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:16:38,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:16:38" (1/1) ... [2018-01-25 06:16:38,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be6e797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:38, skipping insertion in model container [2018-01-25 06:16:38,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:16:38" (1/1) ... [2018-01-25 06:16:38,936 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:16:38,975 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:16:39,098 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:16:39,120 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:16:39,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39 WrapperNode [2018-01-25 06:16:39,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:16:39,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:16:39,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:16:39,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:16:39,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... [2018-01-25 06:16:39,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:16:39,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:16:39,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:16:39,174 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:16:39,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (1/1) ... No working directory specified, using /storage/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-01-25 06:16:39,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:16:39,231 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:16:39,231 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:16:39,232 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:16:39,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:16:39,233 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:16:39,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:16:39,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:16:39,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:16:39,695 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:16:39,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:16:39 BoogieIcfgContainer [2018-01-25 06:16:39,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:16:39,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:16:39,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:16:39,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:16:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:16:38" (1/3) ... [2018-01-25 06:16:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8ddcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:16:39, skipping insertion in model container [2018-01-25 06:16:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:16:39" (2/3) ... [2018-01-25 06:16:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8ddcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:16:39, skipping insertion in model container [2018-01-25 06:16:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:16:39" (3/3) ... [2018-01-25 06:16:39,702 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:16:39,709 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:16:39,715 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-25 06:16:39,761 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:16:39,761 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:16:39,761 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:16:39,761 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:16:39,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:16:39,761 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:16:39,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:16:39,762 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:16:39,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:16:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-25 06:16:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:16:39,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:39,784 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:39,784 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-01-25 06:16:39,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:39,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:39,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:39,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:39,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:39,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:39,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:39,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:16:39,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:39,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:16:39,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:16:39,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:16:39,995 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-01-25 06:16:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:40,306 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-01-25 06:16:40,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:16:40,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:16:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:40,321 INFO L225 Difference]: With dead ends: 222 [2018-01-25 06:16:40,321 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 06:16:40,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 06:16:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-01-25 06:16:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 06:16:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-25 06:16:40,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-01-25 06:16:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:40,369 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-25 06:16:40,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:16:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-25 06:16:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:16:40,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:40,370 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:40,370 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:40,371 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-01-25 06:16:40,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:40,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:40,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,372 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:40,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:40,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:40,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:16:40,454 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:40,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:16:40,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:16:40,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:16:40,456 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-01-25 06:16:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:40,572 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-25 06:16:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:16:40,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:16:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:40,575 INFO L225 Difference]: With dead ends: 116 [2018-01-25 06:16:40,575 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:16:40,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:16:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-01-25 06:16:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-25 06:16:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-25 06:16:40,587 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-01-25 06:16:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:40,588 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-25 06:16:40,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:16:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-25 06:16:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:16:40,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:40,589 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:40,589 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-01-25 06:16:40,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:40,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:40,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:40,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:40,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:40,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:16:40,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:40,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:16:40,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:16:40,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:16:40,666 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-01-25 06:16:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:40,802 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-25 06:16:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:16:40,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 06:16:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:40,804 INFO L225 Difference]: With dead ends: 107 [2018-01-25 06:16:40,804 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 06:16:40,805 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 06:16:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-25 06:16:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 06:16:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-25 06:16:40,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-01-25 06:16:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:40,815 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-25 06:16:40,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:16:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-25 06:16:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:16:40,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:40,816 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:40,816 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:40,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-01-25 06:16:40,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:40,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:40,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:40,818 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:40,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:40,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:40,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:16:40,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:40,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:16:40,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:16:40,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:40,919 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-25 06:16:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:41,052 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 06:16:41,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:16:41,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 06:16:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:41,054 INFO L225 Difference]: With dead ends: 117 [2018-01-25 06:16:41,054 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 06:16:41,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:16:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 06:16:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-01-25 06:16:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 06:16:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-25 06:16:41,063 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-01-25 06:16:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:41,064 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-25 06:16:41,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:16:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-25 06:16:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:16:41,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:41,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:41,065 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-01-25 06:16:41,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:41,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:41,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:41,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:41,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:41,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:16:41,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:41,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:16:41,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:16:41,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:41,180 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-25 06:16:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:41,440 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-25 06:16:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:16:41,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:16:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:41,443 INFO L225 Difference]: With dead ends: 146 [2018-01-25 06:16:41,443 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 06:16:41,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:16:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 06:16:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-01-25 06:16:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 06:16:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-25 06:16:41,456 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-01-25 06:16:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:41,456 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-25 06:16:41,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:16:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-25 06:16:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:16:41,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:41,458 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:41,458 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-01-25 06:16:41,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:41,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:41,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:41,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:41,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:41,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:16:41,520 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:41,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:16:41,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:16:41,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:16:41,521 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-01-25 06:16:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:41,710 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-25 06:16:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:16:41,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:16:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:41,712 INFO L225 Difference]: With dead ends: 142 [2018-01-25 06:16:41,712 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 06:16:41,712 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:16:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 06:16:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-01-25 06:16:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 06:16:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-25 06:16:41,722 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-01-25 06:16:41,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:41,723 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-25 06:16:41,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:16:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-25 06:16:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:16:41,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:41,724 INFO L322 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] [2018-01-25 06:16:41,724 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:41,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-01-25 06:16:41,724 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:41,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:41,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:41,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:41,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:41,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:41,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:16:41,955 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:41,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:16:41,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:16:41,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:16:41,956 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 10 states. [2018-01-25 06:16:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:42,325 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-25 06:16:42,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:16:42,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 06:16:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:42,327 INFO L225 Difference]: With dead ends: 140 [2018-01-25 06:16:42,327 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:16:42,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:16:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:16:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-01-25 06:16:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 06:16:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-25 06:16:42,337 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-01-25 06:16:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:42,338 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-25 06:16:42,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:16:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-25 06:16:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:16:42,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:42,339 INFO L322 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] [2018-01-25 06:16:42,339 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-01-25 06:16:42,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:42,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:42,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:42,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:42,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:42,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:42,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:42,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:16:42,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:42,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:16:42,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:16:42,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:16:42,624 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-01-25 06:16:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:42,940 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-25 06:16:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:16:42,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 06:16:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:42,941 INFO L225 Difference]: With dead ends: 177 [2018-01-25 06:16:42,942 INFO L226 Difference]: Without dead ends: 172 [2018-01-25 06:16:42,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-25 06:16:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-25 06:16:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-01-25 06:16:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 06:16:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-25 06:16:42,953 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-01-25 06:16:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:42,953 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-25 06:16:42,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:16:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-25 06:16:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:16:42,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:42,955 INFO L322 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] [2018-01-25 06:16:42,955 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-01-25 06:16:42,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:42,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:42,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:42,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:42,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:42,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:43,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:43,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:16:43,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:43,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:16:43,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:16:43,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:16:43,072 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-01-25 06:16:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:43,559 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-25 06:16:43,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:16:43,560 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 06:16:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:43,564 INFO L225 Difference]: With dead ends: 123 [2018-01-25 06:16:43,564 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 06:16:43,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:16:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 06:16:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-25 06:16:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:16:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-01-25 06:16:43,578 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-01-25 06:16:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:43,578 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-01-25 06:16:43,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:16:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-01-25 06:16:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:16:43,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:43,580 INFO L322 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] [2018-01-25 06:16:43,580 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-01-25 06:16:43,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:43,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:43,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:43,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:43,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:43,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:43,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:43,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:16:43,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:43,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:16:43,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:16:43,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:16:43,737 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-01-25 06:16:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:44,147 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-25 06:16:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:16:44,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 06:16:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:44,148 INFO L225 Difference]: With dead ends: 123 [2018-01-25 06:16:44,148 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 06:16:44,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:16:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 06:16:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-01-25 06:16:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 06:16:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-25 06:16:44,154 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-01-25 06:16:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:44,155 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-25 06:16:44,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:16:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-25 06:16:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:16:44,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:44,156 INFO L322 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] [2018-01-25 06:16:44,156 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-01-25 06:16:44,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:44,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:44,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:44,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:44,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:44,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:44,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:44,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:16:44,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:44,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:16:44,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:16:44,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:16:44,364 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-01-25 06:16:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:44,709 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-25 06:16:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:16:44,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 06:16:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:44,710 INFO L225 Difference]: With dead ends: 147 [2018-01-25 06:16:44,710 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 06:16:44,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:16:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 06:16:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-01-25 06:16:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 06:16:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-25 06:16:44,717 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-01-25 06:16:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:44,717 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-25 06:16:44,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:16:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-25 06:16:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:16:44,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:44,718 INFO L322 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] [2018-01-25 06:16:44,718 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-01-25 06:16:44,719 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:44,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:44,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:44,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:44,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:44,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:44,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:44,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:16:44,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:44,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:16:44,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:16:44,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:16:44,985 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-01-25 06:16:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:45,308 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-01-25 06:16:45,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:16:45,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-25 06:16:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:45,310 INFO L225 Difference]: With dead ends: 159 [2018-01-25 06:16:45,310 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 06:16:45,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:16:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 06:16:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-01-25 06:16:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 06:16:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-25 06:16:45,317 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-01-25 06:16:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:45,317 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-25 06:16:45,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:16:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-25 06:16:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:16:45,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:45,318 INFO L322 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] [2018-01-25 06:16:45,318 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-01-25 06:16:45,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:45,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:45,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:45,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:45,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:45,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:45,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:45,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:16:45,393 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:45,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:16:45,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:16:45,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:16:45,394 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-01-25 06:16:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:45,701 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-25 06:16:45,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:16:45,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-25 06:16:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:45,703 INFO L225 Difference]: With dead ends: 140 [2018-01-25 06:16:45,703 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:16:45,703 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:16:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:16:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-01-25 06:16:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 06:16:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-25 06:16:45,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-01-25 06:16:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:45,715 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-25 06:16:45,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:16:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-25 06:16:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:16:45,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:45,717 INFO L322 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] [2018-01-25 06:16:45,717 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-01-25 06:16:45,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:45,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:45,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:45,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:45,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:45,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:46,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:46,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:16:46,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:46,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:16:46,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:16:46,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:16:46,102 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-01-25 06:16:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:46,611 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-25 06:16:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:16:46,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-25 06:16:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:46,648 INFO L225 Difference]: With dead ends: 169 [2018-01-25 06:16:46,648 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 06:16:46,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-25 06:16:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 06:16:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-01-25 06:16:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:16:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-25 06:16:46,658 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-01-25 06:16:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:46,658 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-25 06:16:46,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:16:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-25 06:16:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:16:46,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:46,659 INFO L322 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] [2018-01-25 06:16:46,660 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-01-25 06:16:46,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:46,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:46,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:46,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:46,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:46,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:46,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:46,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:16:46,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:46,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:16:46,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:16:46,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:16:46,935 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2018-01-25 06:16:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:47,348 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-25 06:16:47,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:16:47,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 06:16:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:47,349 INFO L225 Difference]: With dead ends: 144 [2018-01-25 06:16:47,349 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 06:16:47,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-25 06:16:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 06:16:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-01-25 06:16:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:16:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-01-25 06:16:47,361 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-01-25 06:16:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:47,361 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-01-25 06:16:47,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:16:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-01-25 06:16:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:16:47,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:47,363 INFO L322 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] [2018-01-25 06:16:47,363 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:47,363 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-01-25 06:16:47,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:47,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:47,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:47,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:47,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:47,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:47,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:47,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:16:47,574 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:47,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:16:47,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:16:47,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:16:47,575 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-01-25 06:16:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:47,881 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-25 06:16:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:16:47,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 06:16:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:47,882 INFO L225 Difference]: With dead ends: 154 [2018-01-25 06:16:47,882 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 06:16:47,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:16:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 06:16:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-01-25 06:16:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:16:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-01-25 06:16:47,896 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-01-25 06:16:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:47,896 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-01-25 06:16:47,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:16:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-01-25 06:16:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:16:47,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:47,897 INFO L322 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] [2018-01-25 06:16:47,897 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-01-25 06:16:47,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:47,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:47,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:47,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:47,898 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:47,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:48,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:48,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:16:48,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:48,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:16:48,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:16:48,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:16:48,145 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-01-25 06:16:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:48,439 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-01-25 06:16:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:16:48,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 06:16:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:48,441 INFO L225 Difference]: With dead ends: 148 [2018-01-25 06:16:48,441 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 06:16:48,441 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:16:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 06:16:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-01-25 06:16:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:16:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-01-25 06:16:48,454 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-01-25 06:16:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:48,455 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-01-25 06:16:48,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:16:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-01-25 06:16:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:16:48,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:48,456 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:16:48,456 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-01-25 06:16:48,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:48,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:48,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:48,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:48,458 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:48,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:48,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:16:48,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 06:16:48,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:16:48,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:16:48,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:16:48,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:16:48,711 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-01-25 06:16:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:16:49,015 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-25 06:16:49,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:16:49,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-25 06:16:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:16:49,016 INFO L225 Difference]: With dead ends: 165 [2018-01-25 06:16:49,016 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 06:16:49,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-25 06:16:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 06:16:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-01-25 06:16:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:16:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-01-25 06:16:49,030 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-01-25 06:16:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:16:49,030 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-01-25 06:16:49,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:16:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-01-25 06:16:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:16:49,031 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:16:49,031 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 06:16:49,031 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:16:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-01-25 06:16:49,031 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:16:49,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:49,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:49,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:16:49,033 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:16:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:49,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:16:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:16:49,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:16:49,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:16:49,239 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 06:16:49,241 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [83], [86], [89], [93], [98], [102], [110], [112], [113], [119], [123], [124], [127], [130], [133], [151], [155], [161], [164], [201], [202], [206], [207], [208] [2018-01-25 06:16:49,288 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:16:49,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:17:36,146 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:17:36,146 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:17:36,147 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:17:36,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:17:36,147 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/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-01-25 06:17:36,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:17:36,153 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:17:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:17:36,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:17:36,207 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:17:36,208 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:17:36,214 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:17:36,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:17:36 BoogieIcfgContainer [2018-01-25 06:17:36,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:17:36,215 INFO L168 Benchmark]: Toolchain (without parser) took 57307.42 ms. Allocated memory was 303.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 263.6 MB in the beginning and 1.2 GB in the end (delta: -938.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-25 06:17:36,217 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:17:36,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.39 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:17:36,217 INFO L168 Benchmark]: Boogie Preprocessor took 42.05 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:17:36,218 INFO L168 Benchmark]: RCFGBuilder took 522.79 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 218.9 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. [2018-01-25 06:17:36,218 INFO L168 Benchmark]: TraceAbstraction took 56518.01 ms. Allocated memory was 303.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.9 MB in the beginning and 1.2 GB in the end (delta: -984.2 MB). Peak memory consumption was 984.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:17:36,220 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.39 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.05 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 522.79 ms. Allocated memory is still 303.6 MB. Free memory was 248.5 MB in the beginning and 218.9 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56518.01 ms. Allocated memory was 303.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 217.9 MB in the beginning and 1.2 GB in the end (delta: -984.2 MB). Peak memory consumption was 984.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 11 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 47 error locations. TIMEOUT Result, 56.4s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1123 SDtfs, 4584 SDslu, 3589 SDs, 0 SdLazy, 3967 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 22 SyntacticMatches, 27 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 487 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 109563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-17-36-230.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-circular_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-17-36-230.csv Completed graceful shutdown