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/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:20:57,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:20:57,188 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:20:57,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:20:57,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:20:57,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:20:57,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:20:57,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:20:57,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:20:57,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:20:57,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:20:57,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:20:57,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:20:57,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:20:57,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:20:57,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:20:57,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:20:57,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:20:57,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:20:57,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:20:57,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:20:57,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:20:57,224 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:20:57,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:20:57,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:20:57,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:20:57,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:20:57,228 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:20:57,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:20:57,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:20:57,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:20:57,229 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:20:57,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:20:57,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:20:57,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:20:57,240 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:20:57,240 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:20:57,240 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:20:57,240 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:20:57,241 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:20:57,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:20:57,242 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:20:57,243 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:20:57,243 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:20:57,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:20:57,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:20:57,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:20:57,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:20:57,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:20:57,244 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:20:57,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:20:57,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:20:57,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:20:57,245 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:20:57,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:20:57,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:20:57,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:20:57,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:20:57,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:20:57,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:20:57,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:20:57,247 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:20:57,247 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:20:57,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:20:57,295 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:20:57,299 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:20:57,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:20:57,301 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:20:57,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:20:57,467 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:20:57,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:20:57,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:20:57,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:20:57,476 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:20:57,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,479 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:20:57, skipping insertion in model container [2018-01-25 06:20:57,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,492 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:20:57,533 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:20:57,674 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:20:57,700 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:20:57,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57 WrapperNode [2018-01-25 06:20:57,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:20:57,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:20:57,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:20:57,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:20:57,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (1/1) ... [2018-01-25 06:20:57,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:20:57,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:20:57,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:20:57,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:20:57,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (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:20:57,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:20:57,819 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:20:57,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:20:57,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:20:57,820 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:20:57,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:20:57,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:20:57,820 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:20:57,820 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:20:57,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:20:58,442 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:20:58,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:20:58 BoogieIcfgContainer [2018-01-25 06:20:58,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:20:58,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:20:58,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:20:58,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:20:58,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:20:57" (1/3) ... [2018-01-25 06:20:58,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ef7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:20:58, skipping insertion in model container [2018-01-25 06:20:58,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:20:57" (2/3) ... [2018-01-25 06:20:58,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ef7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:20:58, skipping insertion in model container [2018-01-25 06:20:58,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:20:58" (3/3) ... [2018-01-25 06:20:58,449 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:20:58,456 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:20:58,463 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-25 06:20:58,518 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:20:58,519 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:20:58,519 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:20:58,519 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:20:58,519 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:20:58,519 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:20:58,520 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:20:58,520 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:20:58,521 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:20:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2018-01-25 06:20:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:20:58,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:20:58,555 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:20:58,556 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:20:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428784, now seen corresponding path program 1 times [2018-01-25 06:20:58,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:20:58,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:58,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:20:58,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:58,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:20:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:20:58,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:20:58,721 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:20:58,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:20:58,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:20:58,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:20:58,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:20:58,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:20:58,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:20:58,739 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2018-01-25 06:20:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:20:59,083 INFO L93 Difference]: Finished difference Result 384 states and 511 transitions. [2018-01-25 06:20:59,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:20:59,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:20:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:20:59,095 INFO L225 Difference]: With dead ends: 384 [2018-01-25 06:20:59,096 INFO L226 Difference]: Without dead ends: 206 [2018-01-25 06:20:59,099 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:20:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-25 06:20:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2018-01-25 06:20:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-25 06:20:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-01-25 06:20:59,142 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 8 [2018-01-25 06:20:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:20:59,143 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-01-25 06:20:59,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:20:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-01-25 06:20:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:20:59,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:20:59,144 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:20:59,144 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:20:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1781428785, now seen corresponding path program 1 times [2018-01-25 06:20:59,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:20:59,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:59,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:20:59,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:59,146 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:20:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:20:59,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:20:59,242 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:20:59,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:20:59,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:20:59,243 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:20:59,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:20:59,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:20:59,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:20:59,245 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 4 states. [2018-01-25 06:20:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:20:59,454 INFO L93 Difference]: Finished difference Result 209 states and 221 transitions. [2018-01-25 06:20:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:20:59,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:20:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:20:59,457 INFO L225 Difference]: With dead ends: 209 [2018-01-25 06:20:59,457 INFO L226 Difference]: Without dead ends: 199 [2018-01-25 06:20:59,458 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:20:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-25 06:20:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 188. [2018-01-25 06:20:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-25 06:20:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-25 06:20:59,475 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 8 [2018-01-25 06:20:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:20:59,476 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-25 06:20:59,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:20:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-25 06:20:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:20:59,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:20:59,477 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:20:59,477 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:20:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402511, now seen corresponding path program 1 times [2018-01-25 06:20:59,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:20:59,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:59,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:20:59,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:20:59,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:20:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:20:59,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:20:59,539 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:20:59,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:20:59,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:20:59,540 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:20:59,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:20:59,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:20:59,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:20:59,540 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-25 06:20:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:20:59,998 INFO L93 Difference]: Finished difference Result 320 states and 347 transitions. [2018-01-25 06:21:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:00,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:21:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:00,024 INFO L225 Difference]: With dead ends: 320 [2018-01-25 06:21:00,024 INFO L226 Difference]: Without dead ends: 319 [2018-01-25 06:21:00,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-25 06:21:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 187. [2018-01-25 06:21:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-25 06:21:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2018-01-25 06:21:00,039 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 17 [2018-01-25 06:21:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:00,040 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2018-01-25 06:21:00,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-01-25 06:21:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:21:00,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:00,040 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:00,041 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1247402512, now seen corresponding path program 1 times [2018-01-25 06:21:00,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:00,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:00,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:00,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:00,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:00,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:00,117 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:21:00,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:00,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:21:00,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:00,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:00,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:00,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:00,118 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 5 states. [2018-01-25 06:21:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:00,416 INFO L93 Difference]: Finished difference Result 349 states and 386 transitions. [2018-01-25 06:21:00,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:00,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:21:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:00,419 INFO L225 Difference]: With dead ends: 349 [2018-01-25 06:21:00,419 INFO L226 Difference]: Without dead ends: 348 [2018-01-25 06:21:00,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-25 06:21:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 186. [2018-01-25 06:21:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-25 06:21:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-01-25 06:21:00,433 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 17 [2018-01-25 06:21:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:00,433 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-01-25 06:21:00,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-01-25 06:21:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:21:00,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:00,434 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] [2018-01-25 06:21:00,434 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177125, now seen corresponding path program 1 times [2018-01-25 06:21:00,435 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:00,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:00,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:00,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:00,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:00,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:00,563 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:21:00,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:00,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:21:00,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:00,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:21:00,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:21:00,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:00,564 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-01-25 06:21:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:01,120 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2018-01-25 06:21:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:21:01,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 06:21:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:01,123 INFO L225 Difference]: With dead ends: 323 [2018-01-25 06:21:01,123 INFO L226 Difference]: Without dead ends: 322 [2018-01-25 06:21:01,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:21:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-25 06:21:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 185. [2018-01-25 06:21:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-25 06:21:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-01-25 06:21:01,139 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 20 [2018-01-25 06:21:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:01,139 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-01-25 06:21:01,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:21:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-01-25 06:21:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:21:01,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:01,141 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] [2018-01-25 06:21:01,141 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1311177126, now seen corresponding path program 1 times [2018-01-25 06:21:01,141 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:01,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:01,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:01,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:01,143 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:01,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:01,560 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:21:01,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:01,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:21:01,561 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:01,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:21:01,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:21:01,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:01,562 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-01-25 06:21:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:02,117 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2018-01-25 06:21:02,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:21:02,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 06:21:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:02,119 INFO L225 Difference]: With dead ends: 325 [2018-01-25 06:21:02,119 INFO L226 Difference]: Without dead ends: 324 [2018-01-25 06:21:02,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:21:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-25 06:21:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 184. [2018-01-25 06:21:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-25 06:21:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-01-25 06:21:02,128 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 20 [2018-01-25 06:21:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:02,128 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-01-25 06:21:02,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:21:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-01-25 06:21:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:21:02,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:02,129 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:02,129 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:02,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1745739826, now seen corresponding path program 1 times [2018-01-25 06:21:02,130 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:02,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:02,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,131 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:02,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:02,239 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:21:02,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:02,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:21:02,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:02,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:02,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:02,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:02,240 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 5 states. [2018-01-25 06:21:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:02,435 INFO L93 Difference]: Finished difference Result 428 states and 470 transitions. [2018-01-25 06:21:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:02,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 06:21:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:02,438 INFO L225 Difference]: With dead ends: 428 [2018-01-25 06:21:02,438 INFO L226 Difference]: Without dead ends: 272 [2018-01-25 06:21:02,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:21:02,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-25 06:21:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2018-01-25 06:21:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-25 06:21:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2018-01-25 06:21:02,449 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 26 [2018-01-25 06:21:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:02,450 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2018-01-25 06:21:02,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2018-01-25 06:21:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:21:02,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:02,451 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] [2018-01-25 06:21:02,451 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:02,451 INFO L82 PathProgramCache]: Analyzing trace with hash 33879827, now seen corresponding path program 1 times [2018-01-25 06:21:02,451 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:02,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:02,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,452 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:02,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:02,543 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:21:02,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:02,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:21:02,544 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:02,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:02,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:02,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:02,545 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand 5 states. [2018-01-25 06:21:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:02,705 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-25 06:21:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:21:02,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-25 06:21:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:02,706 INFO L225 Difference]: With dead ends: 210 [2018-01-25 06:21:02,706 INFO L226 Difference]: Without dead ends: 198 [2018-01-25 06:21:02,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-25 06:21:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2018-01-25 06:21:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-25 06:21:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-01-25 06:21:02,713 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 28 [2018-01-25 06:21:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:02,713 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-01-25 06:21:02,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-01-25 06:21:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:21:02,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:02,714 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] [2018-01-25 06:21:02,715 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:02,715 INFO L82 PathProgramCache]: Analyzing trace with hash 33879828, now seen corresponding path program 1 times [2018-01-25 06:21:02,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:02,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:02,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:02,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:02,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:02,913 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:21:02,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:02,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:21:02,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:02,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:21:02,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:21:02,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:21:02,915 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 7 states. [2018-01-25 06:21:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:03,134 INFO L93 Difference]: Finished difference Result 236 states and 251 transitions. [2018-01-25 06:21:03,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:03,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 06:21:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:03,135 INFO L225 Difference]: With dead ends: 236 [2018-01-25 06:21:03,136 INFO L226 Difference]: Without dead ends: 232 [2018-01-25 06:21:03,136 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:21:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-25 06:21:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 207. [2018-01-25 06:21:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-25 06:21:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2018-01-25 06:21:03,145 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 28 [2018-01-25 06:21:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:03,146 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2018-01-25 06:21:03,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:21:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2018-01-25 06:21:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:21:03,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:03,147 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:03,147 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash -3315817, now seen corresponding path program 1 times [2018-01-25 06:21:03,148 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:03,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:03,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:03,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:03,209 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:21:03,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:03,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:21:03,209 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:03,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:21:03,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:21:03,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:21:03,210 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand 6 states. [2018-01-25 06:21:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:03,405 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2018-01-25 06:21:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:21:03,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 06:21:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:03,406 INFO L225 Difference]: With dead ends: 296 [2018-01-25 06:21:03,407 INFO L226 Difference]: Without dead ends: 295 [2018-01-25 06:21:03,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:21:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-01-25 06:21:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 206. [2018-01-25 06:21:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-25 06:21:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 233 transitions. [2018-01-25 06:21:03,419 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 233 transitions. Word has length 31 [2018-01-25 06:21:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:03,419 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 233 transitions. [2018-01-25 06:21:03,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:21:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 233 transitions. [2018-01-25 06:21:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 06:21:03,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:03,421 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:03,421 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash -3315816, now seen corresponding path program 1 times [2018-01-25 06:21:03,421 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:03,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:03,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:03,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:03,501 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:21:03,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:03,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:21:03,502 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:03,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:21:03,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:21:03,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:21:03,503 INFO L87 Difference]: Start difference. First operand 206 states and 233 transitions. Second operand 6 states. [2018-01-25 06:21:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:03,867 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2018-01-25 06:21:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:21:03,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 06:21:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:03,869 INFO L225 Difference]: With dead ends: 326 [2018-01-25 06:21:03,869 INFO L226 Difference]: Without dead ends: 317 [2018-01-25 06:21:03,869 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:21:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-01-25 06:21:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 191. [2018-01-25 06:21:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-25 06:21:03,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-01-25 06:21:03,882 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 31 [2018-01-25 06:21:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:03,883 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-01-25 06:21:03,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:21:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-01-25 06:21:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 06:21:03,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:03,884 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, 1, 1] [2018-01-25 06:21:03,884 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash 253584673, now seen corresponding path program 1 times [2018-01-25 06:21:03,885 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:03,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:03,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:03,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:03,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:03,930 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:21:03,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:03,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:21:03,931 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:03,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:03,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:03,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:03,932 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-01-25 06:21:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:04,187 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2018-01-25 06:21:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:21:04,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-25 06:21:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:04,189 INFO L225 Difference]: With dead ends: 269 [2018-01-25 06:21:04,189 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 06:21:04,190 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:21:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 06:21:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2018-01-25 06:21:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-25 06:21:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-01-25 06:21:04,198 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 36 [2018-01-25 06:21:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:04,198 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-01-25 06:21:04,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-01-25 06:21:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:21:04,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:04,200 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:04,200 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1898871922, now seen corresponding path program 1 times [2018-01-25 06:21:04,200 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:04,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:04,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:04,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:04,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:04,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:04,732 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 23 DAG size of output 16 [2018-01-25 06:21:04,889 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:21:04,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:04,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:21:04,889 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:04,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 06:21:04,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 06:21:04,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:21:04,890 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 10 states. [2018-01-25 06:21:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:05,579 INFO L93 Difference]: Finished difference Result 420 states and 467 transitions. [2018-01-25 06:21:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 06:21:05,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-25 06:21:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:05,600 INFO L225 Difference]: With dead ends: 420 [2018-01-25 06:21:05,600 INFO L226 Difference]: Without dead ends: 309 [2018-01-25 06:21:05,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-25 06:21:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-25 06:21:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 232. [2018-01-25 06:21:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-01-25 06:21:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 260 transitions. [2018-01-25 06:21:05,614 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 260 transitions. Word has length 42 [2018-01-25 06:21:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:05,614 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 260 transitions. [2018-01-25 06:21:05,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 06:21:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 260 transitions. [2018-01-25 06:21:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 06:21:05,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:05,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:05,616 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:05,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092500, now seen corresponding path program 1 times [2018-01-25 06:21:05,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:05,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:05,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:05,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:05,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:05,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:05,679 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:21:05,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:05,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:21:05,679 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:05,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:05,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:05,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:05,680 INFO L87 Difference]: Start difference. First operand 232 states and 260 transitions. Second operand 5 states. [2018-01-25 06:21:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:05,950 INFO L93 Difference]: Finished difference Result 344 states and 387 transitions. [2018-01-25 06:21:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:05,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-25 06:21:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:05,952 INFO L225 Difference]: With dead ends: 344 [2018-01-25 06:21:05,952 INFO L226 Difference]: Without dead ends: 343 [2018-01-25 06:21:05,953 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-01-25 06:21:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 231. [2018-01-25 06:21:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-25 06:21:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 259 transitions. [2018-01-25 06:21:05,969 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 259 transitions. Word has length 43 [2018-01-25 06:21:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:05,969 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 259 transitions. [2018-01-25 06:21:05,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 259 transitions. [2018-01-25 06:21:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 06:21:05,970 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:05,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:05,971 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1781092501, now seen corresponding path program 1 times [2018-01-25 06:21:05,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:05,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:05,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:05,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:05,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:05,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:06,062 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:21:06,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:21:06,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:21:06,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:21:06,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:21:06,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:21:06,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:21:06,064 INFO L87 Difference]: Start difference. First operand 231 states and 259 transitions. Second operand 5 states. [2018-01-25 06:21:06,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:21:06,369 INFO L93 Difference]: Finished difference Result 376 states and 426 transitions. [2018-01-25 06:21:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:21:06,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-25 06:21:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:21:06,371 INFO L225 Difference]: With dead ends: 376 [2018-01-25 06:21:06,371 INFO L226 Difference]: Without dead ends: 375 [2018-01-25 06:21:06,372 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:21:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-25 06:21:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 230. [2018-01-25 06:21:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-25 06:21:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 258 transitions. [2018-01-25 06:21:06,387 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 258 transitions. Word has length 43 [2018-01-25 06:21:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:21:06,388 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 258 transitions. [2018-01-25 06:21:06,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:21:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 258 transitions. [2018-01-25 06:21:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 06:21:06,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:21:06,389 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:21:06,389 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:21:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -661031902, now seen corresponding path program 1 times [2018-01-25 06:21:06,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:21:06,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:06,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:21:06,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:21:06,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:21:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:21:06,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:21:06,514 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:21:06,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:21:06,515 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:21:06,516 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 06:21:06,518 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [13], [18], [22], [28], [31], [32], [58], [59], [62], [67], [68], [71], [77], [81], [87], [91], [93], [96], [207], [211], [216], [220], [228], [234], [235], [236], [238], [242], [246], [321], [326], [330], [336], [339], [438], [439], [440] [2018-01-25 06:21:06,580 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:21:06,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:21:19,531 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:21:19,533 INFO L268 AbstractInterpreter]: Visited 42 different actions 44 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-25 06:21:19,544 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates Received shutdown request... [2018-01-25 06:21:48,541 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 88.24% of their original sizes. [2018-01-25 06:21:48,541 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:21:48,556 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:21:48,561 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:21:48,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:21:48 BoogieIcfgContainer [2018-01-25 06:21:48,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:21:48,562 INFO L168 Benchmark]: Toolchain (without parser) took 51094.58 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 262.0 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 283.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:21:48,562 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:21:48,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.56 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 248.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:21:48,563 INFO L168 Benchmark]: Boogie Preprocessor took 49.33 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.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:21:48,563 INFO L168 Benchmark]: RCFGBuilder took 681.02 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 203.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 5.3 GB. [2018-01-25 06:21:48,564 INFO L168 Benchmark]: TraceAbstraction took 50117.25 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.3 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 224.8 MB. Max. memory is 5.3 GB. [2018-01-25 06:21:48,566 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.56 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 248.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.33 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 681.02 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 203.3 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50117.25 ms. Allocated memory was 302.0 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 203.3 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 224.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 40 LocStat_MAX_WEQGRAPH_SIZE : 22 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 574 LocStat_NO_SUPPORTING_DISEQUALITIES : 140 LocStat_NO_DISJUNCTIONS : -80 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 46 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 53 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 368.296636 RENAME_VARIABLES(MILLISECONDS) : 74.353150 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 208.819243 PROJECTAWAY(MILLISECONDS) : 0.180586 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.223165 DISJOIN(MILLISECONDS) : 32.827512 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 74.423163 ADD_EQUALITY(MILLISECONDS) : 0.009281 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011581 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 108 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 100 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 2 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 13 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 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 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 63 error locations. TIMEOUT Result, 50.0s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2535 SDtfs, 4514 SDslu, 5832 SDs, 0 SdLazy, 4300 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9515652589065001 AbsIntWeakeningRatio, 0.6976744186046512 AbsIntAvgWeakeningVarsNumRemoved, 23.558139534883722 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1309 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 51217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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/sll-01_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-21-48-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-21-48-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-21-48-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_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-21-48-579.csv Completed graceful shutdown