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-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:18:48,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:18:48,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:18:48,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:18:48,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:18:48,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:18:48,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:18:48,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:18:48,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:18:48,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:18:48,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:18:48,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:18:48,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:18:48,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:18:48,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:18:48,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:18:48,684 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:18:48,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:18:48,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:18:48,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:18:48,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:18:48,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:18:48,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:18:48,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:18:48,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:18:48,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:18:48,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:18:48,696 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:18:48,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:18:48,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:18:48,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:18:48,697 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:18:48,705 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:18:48,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:18:48,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:18:48,707 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:18:48,707 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:18:48,707 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:18:48,707 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:18:48,707 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:18:48,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:18:48,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:18:48,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:18:48,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:18:48,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:18:48,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:18:48,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:18:48,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:18:48,710 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:18:48,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:18:48,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:18:48,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:18:48,711 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:18:48,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:18:48,711 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:18:48,711 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:18:48,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:18:48,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:18:48,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:18:48,712 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:18:48,712 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:18:48,713 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:18:48,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:18:48,756 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:18:48,760 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:18:48,761 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:18:48,761 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:18:48,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:18:48,927 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:18:48,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:18:48,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:18:48,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:18:48,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:18:48,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:18:48" (1/1) ... [2018-01-25 06:18:48,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:48, skipping insertion in model container [2018-01-25 06:18:48,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:18:48" (1/1) ... [2018-01-25 06:18:48,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:18:49,011 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:18:49,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:18:49,176 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:18:49,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49 WrapperNode [2018-01-25 06:18:49,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:18:49,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:18:49,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:18:49,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:18:49,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (1/1) ... [2018-01-25 06:18:49,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:18:49,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:18:49,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:18:49,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:18:49,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (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:18:49,291 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:18:49,291 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:18:49,291 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:18:49,291 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:18:49,291 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:18:49,291 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:18:49,292 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:18:49,293 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:18:49,293 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:18:49,895 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:18:49,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:18:49 BoogieIcfgContainer [2018-01-25 06:18:49,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:18:49,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:18:49,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:18:49,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:18:49,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:18:48" (1/3) ... [2018-01-25 06:18:49,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a1fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:18:49, skipping insertion in model container [2018-01-25 06:18:49,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:18:49" (2/3) ... [2018-01-25 06:18:49,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9a1fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:18:49, skipping insertion in model container [2018-01-25 06:18:49,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:18:49" (3/3) ... [2018-01-25 06:18:49,905 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:18:49,913 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:18:49,920 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-01-25 06:18:49,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:18:49,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:18:49,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:18:49,968 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:18:49,968 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:18:49,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:18:49,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:18:49,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:18:49,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:18:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-01-25 06:18:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:18:49,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:49,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:18:49,996 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 115964591, now seen corresponding path program 1 times [2018-01-25 06:18:50,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:50,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:50,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:50,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:50,156 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:18:50,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:50,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:18:50,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:50,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:18:50,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:18:50,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:18:50,267 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2018-01-25 06:18:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:50,580 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2018-01-25 06:18:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:18:50,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:18:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:50,595 INFO L225 Difference]: With dead ends: 320 [2018-01-25 06:18:50,595 INFO L226 Difference]: Without dead ends: 179 [2018-01-25 06:18:50,599 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:18:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-25 06:18:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2018-01-25 06:18:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-25 06:18:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-01-25 06:18:50,639 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 8 [2018-01-25 06:18:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:50,639 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-01-25 06:18:50,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:18:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-01-25 06:18:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:18:50,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:50,640 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:18:50,640 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:50,640 INFO L82 PathProgramCache]: Analyzing trace with hash 115964592, now seen corresponding path program 1 times [2018-01-25 06:18:50,640 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:50,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:50,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,642 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:50,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:50,767 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:18:50,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:50,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:18:50,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:50,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:18:50,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:18:50,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:18:50,770 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 4 states. [2018-01-25 06:18:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:50,932 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-01-25 06:18:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:18:50,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:18:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:50,935 INFO L225 Difference]: With dead ends: 160 [2018-01-25 06:18:50,935 INFO L226 Difference]: Without dead ends: 156 [2018-01-25 06:18:50,936 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:18:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-25 06:18:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-25 06:18:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-25 06:18:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-01-25 06:18:50,951 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 8 [2018-01-25 06:18:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:50,951 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-01-25 06:18:50,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:18:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-01-25 06:18:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:18:50,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:50,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:18:50,952 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 992494940, now seen corresponding path program 1 times [2018-01-25 06:18:50,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:50,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:50,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:50,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:50,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:51,042 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:18:51,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:51,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:18:51,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:51,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:18:51,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:18:51,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:18:51,044 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 4 states. [2018-01-25 06:18:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:51,193 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-01-25 06:18:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:18:51,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 06:18:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:51,195 INFO L225 Difference]: With dead ends: 170 [2018-01-25 06:18:51,195 INFO L226 Difference]: Without dead ends: 162 [2018-01-25 06:18:51,199 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:18:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-25 06:18:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2018-01-25 06:18:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:18:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-01-25 06:18:51,208 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 13 [2018-01-25 06:18:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:51,209 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-01-25 06:18:51,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:18:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-01-25 06:18:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 06:18:51,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:51,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:18:51,210 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash 992494941, now seen corresponding path program 1 times [2018-01-25 06:18:51,210 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:51,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:51,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:51,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:51,282 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:18:51,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:51,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:18:51,283 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:51,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:18:51,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:18:51,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:18:51,284 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 4 states. [2018-01-25 06:18:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:51,470 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2018-01-25 06:18:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:18:51,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 06:18:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:51,472 INFO L225 Difference]: With dead ends: 170 [2018-01-25 06:18:51,472 INFO L226 Difference]: Without dead ends: 162 [2018-01-25 06:18:51,473 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:18:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-25 06:18:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-01-25 06:18:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:18:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-01-25 06:18:51,485 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 13 [2018-01-25 06:18:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:51,485 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-01-25 06:18:51,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:18:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-01-25 06:18:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:18:51,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:51,486 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] [2018-01-25 06:18:51,487 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1268132201, now seen corresponding path program 1 times [2018-01-25 06:18:51,487 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:51,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:51,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,489 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:51,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:51,607 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:18:51,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:51,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:18:51,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:51,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:18:51,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:18:51,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:18:51,608 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 4 states. [2018-01-25 06:18:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:51,746 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-01-25 06:18:51,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:18:51,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 06:18:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:51,748 INFO L225 Difference]: With dead ends: 168 [2018-01-25 06:18:51,748 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 06:18:51,748 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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:18:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 06:18:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-25 06:18:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 06:18:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-25 06:18:51,759 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 21 [2018-01-25 06:18:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:51,759 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-25 06:18:51,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:18:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-25 06:18:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:18:51,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:51,760 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] [2018-01-25 06:18:51,760 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1268132202, now seen corresponding path program 1 times [2018-01-25 06:18:51,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:51,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:51,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:51,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:51,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:51,911 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:18:51,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:51,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:18:51,911 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:51,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:18:51,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:18:51,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:18:51,913 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-01-25 06:18:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:52,221 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2018-01-25 06:18:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:18:52,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 06:18:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:52,222 INFO L225 Difference]: With dead ends: 186 [2018-01-25 06:18:52,223 INFO L226 Difference]: Without dead ends: 179 [2018-01-25 06:18:52,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:18:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-25 06:18:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2018-01-25 06:18:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-25 06:18:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-01-25 06:18:52,232 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 21 [2018-01-25 06:18:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:52,232 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-01-25 06:18:52,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:18:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-01-25 06:18:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:18:52,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:52,233 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] [2018-01-25 06:18:52,233 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1095666644, now seen corresponding path program 1 times [2018-01-25 06:18:52,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:52,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:52,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:52,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:52,288 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:18:52,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:52,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:18:52,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:52,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:18:52,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:18:52,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:18:52,289 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 5 states. [2018-01-25 06:18:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:52,444 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2018-01-25 06:18:52,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:18:52,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:18:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:52,445 INFO L225 Difference]: With dead ends: 199 [2018-01-25 06:18:52,445 INFO L226 Difference]: Without dead ends: 198 [2018-01-25 06:18:52,445 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:18:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-25 06:18:52,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 152. [2018-01-25 06:18:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:18:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-01-25 06:18:52,452 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 23 [2018-01-25 06:18:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:52,453 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-01-25 06:18:52,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:18:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-01-25 06:18:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:18:52,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:52,453 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] [2018-01-25 06:18:52,454 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1095666643, now seen corresponding path program 1 times [2018-01-25 06:18:52,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:52,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:52,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:52,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:52,649 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:18:52,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:52,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:18:52,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:52,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:18:52,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:18:52,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:18:52,651 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 5 states. [2018-01-25 06:18:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:52,851 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-01-25 06:18:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:18:52,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 06:18:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:52,853 INFO L225 Difference]: With dead ends: 226 [2018-01-25 06:18:52,853 INFO L226 Difference]: Without dead ends: 225 [2018-01-25 06:18:52,853 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:18:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-25 06:18:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 151. [2018-01-25 06:18:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-25 06:18:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-01-25 06:18:52,860 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 23 [2018-01-25 06:18:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:52,860 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-01-25 06:18:52,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:18:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-01-25 06:18:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:18:52,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:52,861 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:18:52,861 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1665799662, now seen corresponding path program 1 times [2018-01-25 06:18:52,862 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:52,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:52,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:52,863 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:52,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:52,981 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:18:52,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:52,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:18:52,981 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:52,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:18:52,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:18:52,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:18:52,982 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 9 states. [2018-01-25 06:18:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:53,553 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2018-01-25 06:18:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:18:53,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-25 06:18:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:53,555 INFO L225 Difference]: With dead ends: 160 [2018-01-25 06:18:53,555 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:18:53,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:18:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:18:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-01-25 06:18:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-25 06:18:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-01-25 06:18:53,563 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 27 [2018-01-25 06:18:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:53,563 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-01-25 06:18:53,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:18:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-01-25 06:18:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:18:53,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:53,564 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:18:53,564 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1665799663, now seen corresponding path program 1 times [2018-01-25 06:18:53,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:53,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:53,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:53,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:53,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:53,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:53,786 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:18:53,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:53,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 06:18:53,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:53,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:18:53,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:18:53,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:18:53,787 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 10 states. [2018-01-25 06:18:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:54,637 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-01-25 06:18:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 06:18:54,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-25 06:18:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:54,638 INFO L225 Difference]: With dead ends: 186 [2018-01-25 06:18:54,639 INFO L226 Difference]: Without dead ends: 175 [2018-01-25 06:18:54,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:18:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-25 06:18:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2018-01-25 06:18:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-25 06:18:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-01-25 06:18:54,646 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2018-01-25 06:18:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:54,646 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-01-25 06:18:54,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:18:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-01-25 06:18:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:18:54,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:54,648 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, 1, 1, 1] [2018-01-25 06:18:54,648 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash 37442029, now seen corresponding path program 1 times [2018-01-25 06:18:54,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:54,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:54,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:54,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:54,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:54,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:54,716 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:18:54,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:54,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:18:54,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:54,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:18:54,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:18:54,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:18:54,718 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 5 states. [2018-01-25 06:18:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:54,943 INFO L93 Difference]: Finished difference Result 228 states and 246 transitions. [2018-01-25 06:18:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:18:54,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-25 06:18:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:54,944 INFO L225 Difference]: With dead ends: 228 [2018-01-25 06:18:54,944 INFO L226 Difference]: Without dead ends: 227 [2018-01-25 06:18:54,945 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:18:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-25 06:18:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-01-25 06:18:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:18:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-25 06:18:54,950 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 34 [2018-01-25 06:18:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:54,951 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-25 06:18:54,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:18:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-25 06:18:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:18:54,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:54,952 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, 1, 1, 1] [2018-01-25 06:18:54,953 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 37442030, now seen corresponding path program 1 times [2018-01-25 06:18:54,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:54,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:54,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:54,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:54,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:54,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:55,101 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:18:55,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:55,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:18:55,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:55,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:18:55,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:18:55,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:18:55,103 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 5 states. [2018-01-25 06:18:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:55,328 INFO L93 Difference]: Finished difference Result 255 states and 274 transitions. [2018-01-25 06:18:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:18:55,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-25 06:18:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:55,329 INFO L225 Difference]: With dead ends: 255 [2018-01-25 06:18:55,330 INFO L226 Difference]: Without dead ends: 254 [2018-01-25 06:18:55,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:18:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-25 06:18:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2018-01-25 06:18:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-25 06:18:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-01-25 06:18:55,337 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 34 [2018-01-25 06:18:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:55,337 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-01-25 06:18:55,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:18:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-01-25 06:18:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 06:18:55,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:55,346 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, 1, 1, 1] [2018-01-25 06:18:55,346 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1696437201, now seen corresponding path program 1 times [2018-01-25 06:18:55,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:55,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:55,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:55,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:55,348 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:55,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:55,413 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:18:55,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:18:55,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:18:55,414 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:18:55,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:18:55,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:18:55,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:18:55,414 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 8 states. [2018-01-25 06:18:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:18:55,578 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-01-25 06:18:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:18:55,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-25 06:18:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:18:55,579 INFO L225 Difference]: With dead ends: 222 [2018-01-25 06:18:55,579 INFO L226 Difference]: Without dead ends: 183 [2018-01-25 06:18:55,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:18:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-25 06:18:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-01-25 06:18:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-25 06:18:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-01-25 06:18:55,586 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 34 [2018-01-25 06:18:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:18:55,586 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-01-25 06:18:55,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:18:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-01-25 06:18:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:18:55,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:18:55,588 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:18:55,588 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:18:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1185742895, now seen corresponding path program 1 times [2018-01-25 06:18:55,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:18:55,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:55,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:18:55,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:18:55,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:18:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:18:55,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:18:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:18:55,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:18:55,713 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:18:55,714 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-01-25 06:18:55,716 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [12], [13], [16], [19], [22], [26], [28], [31], [146], [150], [155], [159], [167], [168], [175], [179], [187], [193], [194], [195], [243], [245], [248], [301], [302], [306], [307], [308] [2018-01-25 06:18:55,783 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:18:55,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:19:47,341 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:19:47,342 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:19:47,343 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:19:47,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:19:47,343 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:19:47,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:19:47,349 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:19:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:19:47,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:19:47,417 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:19:47,418 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:19:47,425 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:19:47,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:19:47 BoogieIcfgContainer [2018-01-25 06:19:47,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:19:47,426 INFO L168 Benchmark]: Toolchain (without parser) took 58499.07 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 259.9 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 569.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:19:47,428 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:19:47,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.45 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 246.8 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:19:47,428 INFO L168 Benchmark]: Boogie Preprocessor took 48.01 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 244.8 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:19:47,429 INFO L168 Benchmark]: RCFGBuilder took 659.42 ms. Allocated memory is still 299.9 MB. Free memory was 244.8 MB in the beginning and 204.6 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:19:47,429 INFO L168 Benchmark]: TraceAbstraction took 57527.67 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 204.6 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 514.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:19:47,431 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.14 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.45 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 246.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.01 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 244.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 659.42 ms. Allocated memory is still 299.9 MB. Free memory was 244.8 MB in the beginning and 204.6 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57527.67 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 204.6 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 514.1 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 1049). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 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 37 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 163 locations, 69 error locations. TIMEOUT Result, 57.4s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1345 SDtfs, 3201 SDslu, 2035 SDs, 0 SdLazy, 3024 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 51.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 428 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 20616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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-rb-sentinel_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-19-47-442.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_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-19-47-442.csv Completed graceful shutdown