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_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:15:51,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:15:51,435 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:15:51,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:15:51,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:15:51,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:15:51,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:15:51,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:15:51,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:15:51,462 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:15:51,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:15:51,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:15:51,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:15:51,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:15:51,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:15:51,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:15:51,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:15:51,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:15:51,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:15:51,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:15:51,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:15:51,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:15:51,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:15:51,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:15:51,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:15:51,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:15:51,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:15:51,484 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:15:51,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:15:51,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:15:51,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:15:51,486 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_preciseopt.epf [2018-01-25 03:15:51,498 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:15:51,498 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:15:51,499 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:15:51,499 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:15:51,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:15:51,499 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:15:51,499 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:15:51,499 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:15:51,499 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:15:51,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:15:51,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:15:51,500 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:15:51,500 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:15:51,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:15:51,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:15:51,501 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:15:51,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:15:51,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:15:51,502 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:15:51,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:15:51,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:15:51,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:15:51,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:15:51,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:15:51,504 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:15:51,504 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:15:51,504 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:15:51,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:15:51,552 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:15:51,557 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:15:51,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:15:51,559 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:15:51,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-01-25 03:15:51,787 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:15:51,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:15:51,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:15:51,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:15:51,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:15:51,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:15:51" (1/1) ... [2018-01-25 03:15:51,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:51, skipping insertion in model container [2018-01-25 03:15:51,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:15:51" (1/1) ... [2018-01-25 03:15:51,819 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:15:51,858 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:15:51,991 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:15:52,015 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:15:52,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52 WrapperNode [2018-01-25 03:15:52,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:15:52,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:15:52,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:15:52,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:15:52,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (1/1) ... [2018-01-25 03:15:52,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:15:52,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:15:52,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:15:52,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:15:52,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (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 03:15:52,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:15:52,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:15:52,140 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 03:15:52,141 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:15:52,141 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:15:52,141 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:15:52,141 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:15:52,141 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:15:52,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:15:52,142 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:15:52,143 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 03:15:52,143 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:15:52,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:15:52,143 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:15:52,546 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:15:52,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:15:52 BoogieIcfgContainer [2018-01-25 03:15:52,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:15:52,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:15:52,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:15:52,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:15:52,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:15:51" (1/3) ... [2018-01-25 03:15:52,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918d060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:15:52, skipping insertion in model container [2018-01-25 03:15:52,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:52" (2/3) ... [2018-01-25 03:15:52,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1918d060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:15:52, skipping insertion in model container [2018-01-25 03:15:52,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:15:52" (3/3) ... [2018-01-25 03:15:52,556 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-01-25 03:15:52,565 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:15:52,571 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-25 03:15:52,625 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:15:52,625 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:15:52,626 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:15:52,626 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:15:52,626 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:15:52,626 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:15:52,626 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:15:52,626 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:15:52,627 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:15:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-01-25 03:15:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:15:52,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:52,660 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:52,661 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2135487731, now seen corresponding path program 1 times [2018-01-25 03:15:52,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:52,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:52,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:52,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:52,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:52,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:52,815 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 03:15:52,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:52,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:15:52,818 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:52,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:15:52,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:15:52,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:15:52,834 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-01-25 03:15:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:52,961 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2018-01-25 03:15:52,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:15:52,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-25 03:15:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:52,972 INFO L225 Difference]: With dead ends: 169 [2018-01-25 03:15:52,972 INFO L226 Difference]: Without dead ends: 90 [2018-01-25 03:15:52,977 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 03:15:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-25 03:15:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-25 03:15:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-25 03:15:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-25 03:15:53,015 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 13 [2018-01-25 03:15:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:53,016 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-25 03:15:53,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:15:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-25 03:15:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:15:53,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:53,017 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:53,017 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 757106509, now seen corresponding path program 1 times [2018-01-25 03:15:53,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:53,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:53,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,019 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:53,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:53,132 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 03:15:53,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:53,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:15:53,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:53,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:15:53,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:15:53,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:15:53,135 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2018-01-25 03:15:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:53,426 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2018-01-25 03:15:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:15:53,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:15:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:53,428 INFO L225 Difference]: With dead ends: 127 [2018-01-25 03:15:53,429 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 03:15:53,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 03:15:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-01-25 03:15:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 03:15:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-01-25 03:15:53,441 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-01-25 03:15:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:53,442 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-01-25 03:15:53,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:15:53,442 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-01-25 03:15:53,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:15:53,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:53,443 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:53,443 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 757106510, now seen corresponding path program 1 times [2018-01-25 03:15:53,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:53,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:53,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:53,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:53,544 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 03:15:53,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:53,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:15:53,545 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:53,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:15:53,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:15:53,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:15:53,546 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 5 states. [2018-01-25 03:15:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:53,801 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2018-01-25 03:15:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:15:53,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:15:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:53,803 INFO L225 Difference]: With dead ends: 146 [2018-01-25 03:15:53,804 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 03:15:53,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 03:15:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-01-25 03:15:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:15:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-01-25 03:15:53,817 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 15 [2018-01-25 03:15:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:53,817 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-01-25 03:15:53,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:15:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-01-25 03:15:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:15:53,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:53,819 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:53,819 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918817, now seen corresponding path program 1 times [2018-01-25 03:15:53,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:53,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:53,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:53,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:53,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:53,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:53,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:53,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:53,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:15:53,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:15:53,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:53,915 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 7 states. [2018-01-25 03:15:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:54,540 INFO L93 Difference]: Finished difference Result 229 states and 256 transitions. [2018-01-25 03:15:54,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:15:54,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:15:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:54,545 INFO L225 Difference]: With dead ends: 229 [2018-01-25 03:15:54,545 INFO L226 Difference]: Without dead ends: 226 [2018-01-25 03:15:54,546 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:15:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-25 03:15:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2018-01-25 03:15:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 03:15:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-01-25 03:15:54,561 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-01-25 03:15:54,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:54,562 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-01-25 03:15:54,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:15:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-01-25 03:15:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:15:54,563 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:54,564 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:54,564 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918818, now seen corresponding path program 1 times [2018-01-25 03:15:54,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:54,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:54,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:54,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:54,565 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:54,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:54,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:54,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:54,678 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:54,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:15:54,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:15:54,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:54,679 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-01-25 03:15:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:55,121 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2018-01-25 03:15:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:15:55,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:15:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:55,123 INFO L225 Difference]: With dead ends: 249 [2018-01-25 03:15:55,123 INFO L226 Difference]: Without dead ends: 242 [2018-01-25 03:15:55,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:15:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-25 03:15:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 105. [2018-01-25 03:15:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 03:15:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-25 03:15:55,136 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-01-25 03:15:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:55,137 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-25 03:15:55,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:15:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-25 03:15:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:15:55,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:55,138 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:55,138 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 317364595, now seen corresponding path program 1 times [2018-01-25 03:15:55,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:55,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:55,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:55,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:55,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:55,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:55,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:55,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:15:55,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:15:55,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:15:55,209 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-01-25 03:15:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:55,383 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-01-25 03:15:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:15:55,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 03:15:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:55,384 INFO L225 Difference]: With dead ends: 233 [2018-01-25 03:15:55,384 INFO L226 Difference]: Without dead ends: 187 [2018-01-25 03:15:55,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:15:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-25 03:15:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-01-25 03:15:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 03:15:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-01-25 03:15:55,398 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 27 [2018-01-25 03:15:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:55,398 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-01-25 03:15:55,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:15:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-01-25 03:15:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:15:55,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:55,400 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:15:55,400 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:55,401 INFO L82 PathProgramCache]: Analyzing trace with hash 135192649, now seen corresponding path program 1 times [2018-01-25 03:15:55,401 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:55,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:55,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,402 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:55,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:55,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:55,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:55,516 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:55,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:15:55,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:15:55,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:55,517 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 7 states. [2018-01-25 03:15:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:55,716 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2018-01-25 03:15:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:15:55,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 03:15:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:55,717 INFO L225 Difference]: With dead ends: 159 [2018-01-25 03:15:55,717 INFO L226 Difference]: Without dead ends: 157 [2018-01-25 03:15:55,718 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:15:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-25 03:15:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-01-25 03:15:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 03:15:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-01-25 03:15:55,725 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 30 [2018-01-25 03:15:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:55,726 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-01-25 03:15:55,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:15:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-01-25 03:15:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:15:55,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:55,727 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-25 03:15:55,727 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 135192650, now seen corresponding path program 1 times [2018-01-25 03:15:55,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:55,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:55,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:55,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:55,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:55,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:55,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:55,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:55,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:15:55,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:15:55,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:55,839 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 7 states. [2018-01-25 03:15:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:56,418 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2018-01-25 03:15:56,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:15:56,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 03:15:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:56,420 INFO L225 Difference]: With dead ends: 175 [2018-01-25 03:15:56,420 INFO L226 Difference]: Without dead ends: 171 [2018-01-25 03:15:56,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:15:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-25 03:15:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2018-01-25 03:15:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 03:15:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-01-25 03:15:56,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 30 [2018-01-25 03:15:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:56,431 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-01-25 03:15:56,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:15:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-01-25 03:15:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:15:56,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:56,432 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:56,432 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1848368372, now seen corresponding path program 1 times [2018-01-25 03:15:56,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:56,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:56,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:56,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:56,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:56,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:56,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:56,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:15:56,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:15:56,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:15:56,537 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-01-25 03:15:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:56,697 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-01-25 03:15:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:15:56,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:15:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:56,698 INFO L225 Difference]: With dead ends: 192 [2018-01-25 03:15:56,699 INFO L226 Difference]: Without dead ends: 156 [2018-01-25 03:15:56,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:15:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-25 03:15:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2018-01-25 03:15:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 03:15:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-01-25 03:15:56,710 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 30 [2018-01-25 03:15:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:56,710 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-01-25 03:15:56,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:15:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-01-25 03:15:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:15:56,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:56,712 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:56,712 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash 772815435, now seen corresponding path program 1 times [2018-01-25 03:15:56,712 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:56,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:56,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,713 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:56,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:56,769 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 03:15:56,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:56,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:15:56,770 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:56,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:15:56,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:15:56,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:15:56,771 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 3 states. [2018-01-25 03:15:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:56,797 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2018-01-25 03:15:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:15:56,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-01-25 03:15:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:56,798 INFO L225 Difference]: With dead ends: 129 [2018-01-25 03:15:56,798 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 03:15:56,798 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 03:15:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 03:15:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-25 03:15:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 03:15:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-25 03:15:56,806 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2018-01-25 03:15:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:56,807 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-25 03:15:56,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:15:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-25 03:15:56,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:15:56,809 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:56,809 INFO L322 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2018-01-25 03:15:56,809 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:15:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1113019023, now seen corresponding path program 1 times [2018-01-25 03:15:56,809 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:56,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:56,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:56,811 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:56,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:57,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:15:57,160 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:15:57,161 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 03:15:57,162 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [52], [54], [57], [63], [65], [66], [69], [70], [76], [78], [81], [84], [88], [91], [95], [97], [98], [104], [105], [108], [177], [178], [188], [189], [190] [2018-01-25 03:15:57,210 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:15:57,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:16:49,972 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:16:49,973 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:16:49,974 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:16:49,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:16:49,974 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 03:16:49,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:49,980 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:16:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:50,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:16:50,042 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:16:50,042 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:16:50,047 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:16:50,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:16:50 BoogieIcfgContainer [2018-01-25 03:16:50,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:16:50,048 INFO L168 Benchmark]: Toolchain (without parser) took 58260.37 ms. Allocated memory was 309.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.6 MB in the beginning and 697.3 MB in the end (delta: -429.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 03:16:50,050 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:16:50,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.95 ms. Allocated memory is still 309.3 MB. Free memory was 266.6 MB in the beginning and 255.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:50,050 INFO L168 Benchmark]: Boogie Preprocessor took 43.67 ms. Allocated memory is still 309.3 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:50,051 INFO L168 Benchmark]: RCFGBuilder took 476.23 ms. Allocated memory is still 309.3 MB. Free memory was 253.5 MB in the beginning and 225.9 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:50,051 INFO L168 Benchmark]: TraceAbstraction took 57499.42 ms. Allocated memory was 309.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.9 MB in the beginning and 697.3 MB in the end (delta: -472.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-25 03:16:50,053 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.24 ms. Allocated memory is still 309.3 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.95 ms. Allocated memory is still 309.3 MB. Free memory was 266.6 MB in the beginning and 255.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.67 ms. Allocated memory is still 309.3 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.23 ms. Allocated memory is still 309.3 MB. Free memory was 253.5 MB in the beginning and 225.9 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57499.42 ms. Allocated memory was 309.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.9 MB in the beginning and 697.3 MB in the end (delta: -472.3 MB). Peak memory consumption was 1.5 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 639). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 39 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 33 error locations. TIMEOUT Result, 57.4s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 772 SDtfs, 1407 SDslu, 1693 SDs, 0 SdLazy, 1649 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 496 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 21161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 24/24 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/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-16-50-063.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-16-50-063.csv Completed graceful shutdown