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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:57:33,474 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:57:33,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:57:33,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:57:33,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:57:33,493 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:57:33,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:57:33,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:57:33,498 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:57:33,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:57:33,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:57:33,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:57:33,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:57:33,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:57:33,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:57:33,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:57:33,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:57:33,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:57:33,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:57:33,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:57:33,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:57:33,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:57:33,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:57:33,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:57:33,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:57:33,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:57:33,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:57:33,519 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:57:33,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:57:33,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:57:33,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:57:33,520 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 05:57:33,529 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:57:33,529 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:57:33,530 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:57:33,530 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:57:33,530 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:57:33,530 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:57:33,530 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:57:33,530 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:57:33,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:57:33,531 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:57:33,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:57:33,532 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:57:33,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:57:33,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:57:33,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:57:33,533 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:57:33,533 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:57:33,533 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:57:33,534 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:57:33,534 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:57:33,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:57:33,534 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:57:33,534 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:57:33,535 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:57:33,535 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:57:33,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:57:33,578 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:57:33,582 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:57:33,583 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:57:33,583 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:57:33,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-25 05:57:33,751 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:57:33,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:57:33,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:57:33,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:57:33,763 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:57:33,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:33,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8bf943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33, skipping insertion in model container [2018-01-25 05:57:33,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:33,779 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:57:33,817 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:57:33,942 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:57:33,967 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:57:33,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33 WrapperNode [2018-01-25 05:57:33,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:57:33,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:57:33,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:57:33,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:57:33,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:33,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (1/1) ... [2018-01-25 05:57:34,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:57:34,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:57:34,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:57:34,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:57:34,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (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 05:57:34,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:57:34,070 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:57:34,070 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:57:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:57:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:57:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:57:34,070 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:57:34,071 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:57:34,072 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:57:34,072 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:57:34,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:57:34,072 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:57:34,477 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:57:34,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:57:34 BoogieIcfgContainer [2018-01-25 05:57:34,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:57:34,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:57:34,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:57:34,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:57:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:57:33" (1/3) ... [2018-01-25 05:57:34,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c716ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:57:34, skipping insertion in model container [2018-01-25 05:57:34,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:57:33" (2/3) ... [2018-01-25 05:57:34,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c716ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:57:34, skipping insertion in model container [2018-01-25 05:57:34,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:57:34" (3/3) ... [2018-01-25 05:57:34,485 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-25 05:57:34,491 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:57:34,498 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-25 05:57:34,537 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:57:34,538 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:57:34,538 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:57:34,538 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:57:34,538 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:57:34,538 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:57:34,538 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:57:34,538 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:57:34,539 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:57:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-25 05:57:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:57:34,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:34,563 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:34,563 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-01-25 05:57:34,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:34,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:34,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:34,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:34,677 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 05:57:34,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:34,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:57:34,679 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:34,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:57:34,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:57:34,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:57:34,695 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-01-25 05:57:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:34,793 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-01-25 05:57:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:57:34,794 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-25 05:57:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:34,803 INFO L225 Difference]: With dead ends: 196 [2018-01-25 05:57:34,803 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 05:57:34,808 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:57:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 05:57:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-25 05:57:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 05:57:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-25 05:57:34,845 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-01-25 05:57:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:34,846 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-25 05:57:34,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:57:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-25 05:57:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:57:34,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:34,847 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:34,847 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-01-25 05:57:34,847 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:34,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:34,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,849 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:34,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:34,916 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 05:57:34,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:34,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:34,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:34,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:57:34,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:57:34,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:34,920 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-01-25 05:57:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:34,949 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-25 05:57:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:57:34,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:57:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:34,951 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:57:34,951 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:57:34,952 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:57:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-25 05:57:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 05:57:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-25 05:57:34,960 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-01-25 05:57:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:34,960 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-25 05:57:34,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:57:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-25 05:57:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:57:34,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:34,962 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:34,962 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-01-25 05:57:34,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:34,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:34,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:34,964 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:34,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:35,017 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 05:57:35,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:35,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:35,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:35,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:57:35,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:57:35,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:57:35,018 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-01-25 05:57:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:35,157 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-25 05:57:35,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:57:35,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:57:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:35,161 INFO L225 Difference]: With dead ends: 135 [2018-01-25 05:57:35,161 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 05:57:35,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 05:57:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 05:57:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-01-25 05:57:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:57:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-25 05:57:35,172 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-01-25 05:57:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:35,172 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-25 05:57:35,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:57:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-25 05:57:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:57:35,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:35,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:35,174 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-01-25 05:57:35,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:35,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:35,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:35,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:35,274 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 05:57:35,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:35,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:35,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:35,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:57:35,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:57:35,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:57:35,276 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-01-25 05:57:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:35,461 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-25 05:57:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:57:35,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:57:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:35,463 INFO L225 Difference]: With dead ends: 144 [2018-01-25 05:57:35,463 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 05:57:35,463 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 05:57:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 05:57:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-01-25 05:57:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 05:57:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-01-25 05:57:35,471 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-01-25 05:57:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:35,471 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-01-25 05:57:35,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:57:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-01-25 05:57:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:57:35,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:35,472 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:35,472 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-01-25 05:57:35,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:35,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:35,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,474 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:35,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:35,497 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 05:57:35,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:35,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:57:35,497 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:35,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:57:35,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:57:35,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:35,498 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-01-25 05:57:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:35,551 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-01-25 05:57:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:57:35,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-25 05:57:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:35,552 INFO L225 Difference]: With dead ends: 103 [2018-01-25 05:57:35,552 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 05:57:35,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 05:57:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-01-25 05:57:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 05:57:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-01-25 05:57:35,561 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-01-25 05:57:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:35,561 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-01-25 05:57:35,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:57:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-01-25 05:57:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:57:35,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:35,562 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:35,562 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:35,563 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-01-25 05:57:35,563 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:35,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,564 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:35,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:35,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:57:35,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:35,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:35,647 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:35,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:57:35,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:57:35,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:35,649 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-01-25 05:57:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:35,676 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2018-01-25 05:57:35,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:57:35,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-25 05:57:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:35,678 INFO L225 Difference]: With dead ends: 230 [2018-01-25 05:57:35,678 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:57:35,679 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:57:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:57:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-01-25 05:57:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 05:57:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-01-25 05:57:35,690 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-01-25 05:57:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:35,691 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-01-25 05:57:35,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:57:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-01-25 05:57:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:57:35,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:35,692 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:35,693 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-01-25 05:57:35,693 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:35,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:35,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:35,695 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:35,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:35,825 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 05:57:35,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:35,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:57:35,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:35,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:57:35,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:57:35,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:57:35,827 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-01-25 05:57:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:36,007 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2018-01-25 05:57:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:57:36,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-25 05:57:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:36,009 INFO L225 Difference]: With dead ends: 228 [2018-01-25 05:57:36,009 INFO L226 Difference]: Without dead ends: 225 [2018-01-25 05:57:36,010 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:57:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-25 05:57:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-01-25 05:57:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:57:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-01-25 05:57:36,019 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-01-25 05:57:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:36,019 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-01-25 05:57:36,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:57:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-01-25 05:57:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:57:36,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:36,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:36,021 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-01-25 05:57:36,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:36,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:36,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:36,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:36,085 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 05:57:36,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:36,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:36,085 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:36,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:57:36,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:57:36,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:57:36,086 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-01-25 05:57:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:36,272 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2018-01-25 05:57:36,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:57:36,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 05:57:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:36,274 INFO L225 Difference]: With dead ends: 175 [2018-01-25 05:57:36,274 INFO L226 Difference]: Without dead ends: 171 [2018-01-25 05:57:36,274 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 05:57:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-25 05:57:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-01-25 05:57:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 05:57:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-01-25 05:57:36,283 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-01-25 05:57:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:36,284 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-01-25 05:57:36,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:57:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-01-25 05:57:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:57:36,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:36,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:36,285 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-01-25 05:57:36,286 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:36,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:36,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,287 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:36,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:36,382 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 05:57:36,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:36,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:36,383 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:36,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:57:36,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:57:36,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:57:36,383 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-01-25 05:57:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:36,495 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-25 05:57:36,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:57:36,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 05:57:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:36,497 INFO L225 Difference]: With dead ends: 163 [2018-01-25 05:57:36,497 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 05:57:36,497 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 05:57:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 05:57:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-01-25 05:57:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 05:57:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-01-25 05:57:36,502 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-01-25 05:57:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:36,503 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-01-25 05:57:36,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:57:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-01-25 05:57:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:57:36,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:36,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:36,504 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-01-25 05:57:36,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:36,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:36,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:36,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:36,644 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 05:57:36,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:36,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:57:36,644 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:36,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:57:36,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:57:36,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:57:36,645 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-01-25 05:57:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:36,836 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2018-01-25 05:57:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:57:36,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 05:57:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:36,838 INFO L225 Difference]: With dead ends: 186 [2018-01-25 05:57:36,838 INFO L226 Difference]: Without dead ends: 185 [2018-01-25 05:57:36,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:57:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-25 05:57:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-01-25 05:57:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 05:57:36,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-01-25 05:57:36,849 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-01-25 05:57:36,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:36,850 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-01-25 05:57:36,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:57:36,850 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-01-25 05:57:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:57:36,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:36,852 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:36,852 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:36,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-01-25 05:57:36,852 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:36,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:36,853 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:36,853 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:36,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:37,075 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 05:57:37,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:37,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:57:37,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:37,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:57:37,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:57:37,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:57:37,076 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 10 states. [2018-01-25 05:57:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:37,506 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2018-01-25 05:57:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:57:37,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 05:57:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:37,508 INFO L225 Difference]: With dead ends: 235 [2018-01-25 05:57:37,508 INFO L226 Difference]: Without dead ends: 234 [2018-01-25 05:57:37,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:57:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-25 05:57:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-01-25 05:57:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 05:57:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-01-25 05:57:37,520 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-01-25 05:57:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:37,520 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-01-25 05:57:37,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:57:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-01-25 05:57:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:57:37,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:37,521 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:37,521 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-01-25 05:57:37,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:37,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:37,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:37,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:37,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:37,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:57:37,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:37,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:57:37,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:37,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:57:37,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:57:37,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:57:37,593 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-01-25 05:57:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:37,764 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-01-25 05:57:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:57:37,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-25 05:57:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:37,766 INFO L225 Difference]: With dead ends: 161 [2018-01-25 05:57:37,766 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 05:57:37,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 05:57:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 05:57:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-01-25 05:57:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 05:57:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-01-25 05:57:37,776 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-01-25 05:57:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:37,776 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-01-25 05:57:37,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:57:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-01-25 05:57:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:57:37,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:37,777 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:37,778 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-01-25 05:57:37,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:37,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:37,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:37,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:37,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:37,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:57:37,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:57:37,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:57:37,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:57:37,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:57:37,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:57:37,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:57:37,935 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-01-25 05:57:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:57:38,205 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2018-01-25 05:57:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:57:38,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 05:57:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:57:38,207 INFO L225 Difference]: With dead ends: 213 [2018-01-25 05:57:38,207 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 05:57:38,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:57:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 05:57:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-01-25 05:57:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-25 05:57:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-01-25 05:57:38,222 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-01-25 05:57:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:57:38,223 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-01-25 05:57:38,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:57:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-01-25 05:57:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:57:38,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:57:38,224 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:57:38,224 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 05:57:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-01-25 05:57:38,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:57:38,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:38,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:57:38,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:57:38,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:57:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:57:38,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:57:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:57:38,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:57:38,319 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:57:38,320 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 05:57:38,322 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [113], [117], [163], [165], [166], [167], [171], [172], [173] [2018-01-25 05:57:38,376 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:57:38,377 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:58:38,723 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:58:38,724 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:58:38,725 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:58:38,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:58:38,725 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 05:58:38,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:38,732 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:58:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:38,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:58:38,782 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:58:38,783 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:58:38,788 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:58:38,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:58:38 BoogieIcfgContainer [2018-01-25 05:58:38,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:58:38,789 INFO L168 Benchmark]: Toolchain (without parser) took 65037.48 ms. Allocated memory was 306.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 266.2 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-25 05:58:38,790 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:58:38,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.58 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 254.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:38,791 INFO L168 Benchmark]: Boogie Preprocessor took 41.96 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:38,791 INFO L168 Benchmark]: RCFGBuilder took 457.39 ms. Allocated memory is still 306.2 MB. Free memory was 252.1 MB in the beginning and 222.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:58:38,792 INFO L168 Benchmark]: TraceAbstraction took 64309.89 ms. Allocated memory was 306.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 222.5 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-25 05:58:38,793 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.58 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 254.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.96 ms. Allocated memory is still 306.2 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 457.39 ms. Allocated memory is still 306.2 MB. Free memory was 252.1 MB in the beginning and 222.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64309.89 ms. Allocated memory was 306.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 222.5 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.9 GB. 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 642). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. TIMEOUT Result, 64.2s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1056 SDtfs, 1658 SDslu, 1463 SDs, 0 SdLazy, 1206 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 60.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 553 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 41433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 8/8 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/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-58-38-801.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-58-38-801.csv Completed graceful shutdown