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-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:25:55,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:25:55,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:25:55,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:25:55,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:25:55,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:25:55,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:25:55,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:25:55,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:25:55,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:25:55,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:25:55,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:25:55,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:25:55,297 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:25:55,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:25:55,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:25:55,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:25:55,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:25:55,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:25:55,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:25:55,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:25:55,309 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:25:55,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:25:55,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:25:55,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:25:55,312 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:25:55,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:25:55,313 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:25:55,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:25:55,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:25:55,314 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:25:55,315 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:25:55,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:25:55,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:25:55,325 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:25:55,326 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:25:55,326 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:25:55,326 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:25:55,326 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:25:55,326 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:25:55,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:25:55,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:25:55,327 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:25:55,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:25:55,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:25:55,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:25:55,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:25:55,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:25:55,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:25:55,329 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:25:55,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:25:55,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:25:55,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:25:55,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:25:55,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:25:55,331 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:25:55,332 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:25:55,333 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:25:55,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:25:55,379 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:25:55,383 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:25:55,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:25:55,385 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:25:55,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:25:55,551 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:25:55,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:25:55,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:25:55,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:25:55,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:25:55,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41641836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55, skipping insertion in model container [2018-01-25 06:25:55,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,579 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:25:55,618 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:25:55,734 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:25:55,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:25:55,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55 WrapperNode [2018-01-25 06:25:55,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:25:55,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:25:55,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:25:55,769 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:25:55,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (1/1) ... [2018-01-25 06:25:55,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:25:55,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:25:55,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:25:55,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:25:55,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (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:25:55,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:25:55,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:25:55,858 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:25:55,859 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:25:55,860 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:25:55,860 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:25:55,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:25:55,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:25:56,303 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:25:56,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:25:56 BoogieIcfgContainer [2018-01-25 06:25:56,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:25:56,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:25:56,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:25:56,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:25:56,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:25:55" (1/3) ... [2018-01-25 06:25:56,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c937ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:25:56, skipping insertion in model container [2018-01-25 06:25:56,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:25:55" (2/3) ... [2018-01-25 06:25:56,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c937ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:25:56, skipping insertion in model container [2018-01-25 06:25:56,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:25:56" (3/3) ... [2018-01-25 06:25:56,311 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:25:56,318 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:25:56,325 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-25 06:25:56,363 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:25:56,364 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:25:56,364 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:25:56,364 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:25:56,364 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:25:56,364 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:25:56,364 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:25:56,364 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:25:56,365 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:25:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-01-25 06:25:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:25:56,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:56,389 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:56,390 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775718, now seen corresponding path program 1 times [2018-01-25 06:25:56,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:56,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:56,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:56,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:56,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:56,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:56,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:25:56,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:56,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:25:56,546 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:56,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:25:56,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:25:56,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:25:56,566 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-01-25 06:25:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:56,868 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2018-01-25 06:25:56,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:25:56,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:25:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:56,883 INFO L225 Difference]: With dead ends: 238 [2018-01-25 06:25:56,883 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 06:25:56,887 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:25:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 06:25:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-01-25 06:25:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 06:25:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-01-25 06:25:56,927 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 8 [2018-01-25 06:25:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:56,928 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-01-25 06:25:56,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:25:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-01-25 06:25:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:25:56,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:56,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:56,928 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775717, now seen corresponding path program 1 times [2018-01-25 06:25:56,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:56,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:56,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:56,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:56,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:56,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:56,999 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:25:56,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:57,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:25:57,000 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:57,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:25:57,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:25:57,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:25:57,002 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 4 states. [2018-01-25 06:25:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:57,164 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-01-25 06:25:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:25:57,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:25:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:57,166 INFO L225 Difference]: With dead ends: 133 [2018-01-25 06:25:57,166 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:25:57,167 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:25:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:25:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-01-25 06:25:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 06:25:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-01-25 06:25:57,178 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 8 [2018-01-25 06:25:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:57,179 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-01-25 06:25:57,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:25:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-01-25 06:25:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 06:25:57,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:57,180 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:57,180 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075710, now seen corresponding path program 1 times [2018-01-25 06:25:57,180 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:57,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:57,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,182 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:57,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:57,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:25:57,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:57,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:25:57,240 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:57,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:25:57,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:25:57,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:25:57,241 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 4 states. [2018-01-25 06:25:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:57,419 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-01-25 06:25:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:25:57,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 06:25:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:57,420 INFO L225 Difference]: With dead ends: 126 [2018-01-25 06:25:57,421 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:25:57,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:25:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:25:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-01-25 06:25:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 06:25:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-01-25 06:25:57,431 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 14 [2018-01-25 06:25:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:57,431 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-01-25 06:25:57,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:25:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-01-25 06:25:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 06:25:57,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:57,432 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:57,432 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075709, now seen corresponding path program 1 times [2018-01-25 06:25:57,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:57,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:57,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,435 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:57,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:57,542 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:25:57,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:57,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:25:57,542 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:57,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:25:57,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:25:57,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:25:57,543 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 5 states. [2018-01-25 06:25:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:57,718 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-01-25 06:25:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:25:57,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 06:25:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:57,719 INFO L225 Difference]: With dead ends: 182 [2018-01-25 06:25:57,719 INFO L226 Difference]: Without dead ends: 166 [2018-01-25 06:25:57,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:25:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-25 06:25:57,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-01-25 06:25:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 06:25:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-01-25 06:25:57,731 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 14 [2018-01-25 06:25:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:57,732 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-01-25 06:25:57,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:25:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-01-25 06:25:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:25:57,733 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:57,733 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:57,733 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash -444857017, now seen corresponding path program 1 times [2018-01-25 06:25:57,733 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:57,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,734 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:57,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:57,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:57,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:57,839 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:25:57,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:57,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:25:57,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:57,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:25:57,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:25:57,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:25:57,841 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 5 states. [2018-01-25 06:25:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:58,027 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-25 06:25:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:25:58,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:25:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:58,028 INFO L225 Difference]: With dead ends: 131 [2018-01-25 06:25:58,028 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 06:25:58,029 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:25:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 06:25:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-25 06:25:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 06:25:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-01-25 06:25:58,041 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 18 [2018-01-25 06:25:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:58,041 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-01-25 06:25:58,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:25:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-01-25 06:25:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:25:58,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:58,042 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:58,043 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash -444857018, now seen corresponding path program 1 times [2018-01-25 06:25:58,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:58,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:58,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:58,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:58,102 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:25:58,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:58,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:25:58,103 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:58,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:25:58,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:25:58,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:25:58,104 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 5 states. [2018-01-25 06:25:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:58,226 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-01-25 06:25:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:25:58,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 06:25:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:58,228 INFO L225 Difference]: With dead ends: 132 [2018-01-25 06:25:58,228 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 06:25:58,228 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:25:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 06:25:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-01-25 06:25:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:25:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-25 06:25:58,238 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 18 [2018-01-25 06:25:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:58,238 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-25 06:25:58,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:25:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-25 06:25:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:25:58,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:58,240 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:58,240 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash -418196060, now seen corresponding path program 1 times [2018-01-25 06:25:58,240 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:58,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:58,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:58,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:58,289 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:25:58,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:58,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:25:58,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:58,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:25:58,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:25:58,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:25:58,290 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 6 states. [2018-01-25 06:25:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:58,556 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-25 06:25:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:25:58,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:25:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:58,558 INFO L225 Difference]: With dead ends: 189 [2018-01-25 06:25:58,558 INFO L226 Difference]: Without dead ends: 188 [2018-01-25 06:25:58,558 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:25:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-25 06:25:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-01-25 06:25:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-25 06:25:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-01-25 06:25:58,565 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 18 [2018-01-25 06:25:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:58,566 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-01-25 06:25:58,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:25:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-01-25 06:25:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:25:58,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:58,567 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:25:58,567 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -418196059, now seen corresponding path program 1 times [2018-01-25 06:25:58,567 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:58,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:58,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:58,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:58,666 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:25:58,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:58,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:25:58,667 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:58,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:25:58,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:25:58,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:25:58,668 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 6 states. [2018-01-25 06:25:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:58,918 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2018-01-25 06:25:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:25:58,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:25:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:58,920 INFO L225 Difference]: With dead ends: 216 [2018-01-25 06:25:58,920 INFO L226 Difference]: Without dead ends: 210 [2018-01-25 06:25:58,920 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:25:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-25 06:25:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 112. [2018-01-25 06:25:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 06:25:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-25 06:25:58,928 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 18 [2018-01-25 06:25:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:58,928 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-25 06:25:58,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:25:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-25 06:25:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:25:58,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:58,929 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] [2018-01-25 06:25:58,929 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379848, now seen corresponding path program 1 times [2018-01-25 06:25:58,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:58,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:58,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:58,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:58,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:59,087 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:25:59,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:59,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:25:59,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:59,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:25:59,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:25:59,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:25:59,088 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 11 states. [2018-01-25 06:25:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:25:59,526 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2018-01-25 06:25:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:25:59,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 06:25:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:25:59,528 INFO L225 Difference]: With dead ends: 197 [2018-01-25 06:25:59,528 INFO L226 Difference]: Without dead ends: 196 [2018-01-25 06:25:59,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:25:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-25 06:25:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2018-01-25 06:25:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:25:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-25 06:25:59,538 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 33 [2018-01-25 06:25:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:25:59,539 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-25 06:25:59,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:25:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-25 06:25:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:25:59,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:25:59,540 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] [2018-01-25 06:25:59,541 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:25:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379847, now seen corresponding path program 1 times [2018-01-25 06:25:59,541 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:25:59,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:59,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:59,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:25:59,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:25:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:59,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:25:59,811 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:25:59,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:25:59,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 06:25:59,812 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:25:59,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:25:59,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:25:59,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:25:59,812 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 11 states. [2018-01-25 06:26:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:26:00,428 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-01-25 06:26:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:26:00,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 06:26:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:26:00,429 INFO L225 Difference]: With dead ends: 227 [2018-01-25 06:26:00,429 INFO L226 Difference]: Without dead ends: 226 [2018-01-25 06:26:00,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:26:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-25 06:26:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 135. [2018-01-25 06:26:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:26:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-25 06:26:00,437 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 33 [2018-01-25 06:26:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:26:00,437 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-25 06:26:00,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:26:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-25 06:26:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 06:26:00,439 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:26:00,439 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:26:00,439 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:26:00,439 INFO L82 PathProgramCache]: Analyzing trace with hash 713889595, now seen corresponding path program 1 times [2018-01-25 06:26:00,439 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:26:00,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:26:00,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:26:00,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:26:00,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:26:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:26:00,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:26:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:26:00,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:26:00,602 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:26:00,603 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 06:26:00,605 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [52], [55], [56], [59], [62], [65], [69], [74], [78], [86], [88], [89], [95], [99], [100], [107], [111], [117], [120], [226], [227], [231], [232], [233] [2018-01-25 06:26:00,648 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:26:00,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:26:58,386 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:26:58,387 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:26:58,388 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:26:58,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:26:58,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:26:58,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:26:58,394 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:26:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:26:58,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:26:58,439 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:26:58,439 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:26:58,444 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:26:58,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:26:58 BoogieIcfgContainer [2018-01-25 06:26:58,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:26:58,446 INFO L168 Benchmark]: Toolchain (without parser) took 62894.10 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 261.5 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 623.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:26:58,447 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:26:58,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.76 ms. Allocated memory is still 304.6 MB. Free memory was 261.5 MB in the beginning and 249.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:26:58,448 INFO L168 Benchmark]: Boogie Preprocessor took 40.95 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 247.6 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:26:58,448 INFO L168 Benchmark]: RCFGBuilder took 493.68 ms. Allocated memory is still 304.6 MB. Free memory was 247.6 MB in the beginning and 216.6 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:26:58,448 INFO L168 Benchmark]: TraceAbstraction took 62139.95 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 578.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:26:58,450 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.21 ms. Allocated memory is still 304.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.76 ms. Allocated memory is still 304.6 MB. Free memory was 261.5 MB in the beginning and 249.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.95 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 493.68 ms. Allocated memory is still 304.6 MB. Free memory was 247.6 MB in the beginning and 216.6 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62139.95 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 578.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 45 error locations. TIMEOUT Result, 62.0s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 697 SDtfs, 1800 SDslu, 1500 SDs, 0 SdLazy, 1975 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 57.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 408 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 23012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-token_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-26-58-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_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-26-58-458.csv Completed graceful shutdown