java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:45:27,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:45:27,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:45:27,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:45:27,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:45:27,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:45:27,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:45:27,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:45:27,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:45:27,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:45:27,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:45:27,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:45:27,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:45:27,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:45:27,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:45:27,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:45:27,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:45:27,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:45:27,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:45:27,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:45:27,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:45:27,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:45:27,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:45:27,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:45:27,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:45:27,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:45:27,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:45:27,071 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:45:27,071 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:45:27,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:45:27,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:45:27,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:45:27,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:45:27,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:45:27,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:45:27,084 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:45:27,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:45:27,084 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:45:27,084 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:45:27,084 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:45:27,085 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:45:27,085 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:45:27,086 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:45:27,087 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:45:27,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:45:27,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:45:27,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:45:27,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:45:27,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:45:27,088 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:45:27,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:45:27,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:45:27,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:45:27,089 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:45:27,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:45:27,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:45:27,089 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:45:27,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:45:27,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:45:27,090 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:45:27,090 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:45:27,091 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:45:27,091 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:45:27,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:45:27,135 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:45:27,139 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:45:27,140 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:45:27,141 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:45:27,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-25 05:45:27,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:45:27,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:45:27,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:45:27,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:45:27,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:45:27,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73691d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27, skipping insertion in model container [2018-01-25 05:45:27,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,325 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:45:27,363 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:45:27,480 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:45:27,496 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:45:27,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27 WrapperNode [2018-01-25 05:45:27,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:45:27,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:45:27,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:45:27,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:45:27,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... [2018-01-25 05:45:27,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:45:27,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:45:27,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:45:27,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:45:27,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:45:27,608 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:45:27,608 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:45:27,608 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:45:27,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:45:27,901 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:45:27,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:45:27 BoogieIcfgContainer [2018-01-25 05:45:27,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:45:27,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:45:27,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:45:27,905 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:45:27,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:45:27" (1/3) ... [2018-01-25 05:45:27,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556d550d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:45:27, skipping insertion in model container [2018-01-25 05:45:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:45:27" (2/3) ... [2018-01-25 05:45:27,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556d550d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:45:27, skipping insertion in model container [2018-01-25 05:45:27,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:45:27" (3/3) ... [2018-01-25 05:45:27,908 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-25 05:45:27,915 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:45:27,920 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-25 05:45:27,965 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:45:27,965 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:45:27,965 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:45:27,965 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:45:27,965 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:45:27,966 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:45:27,966 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:45:27,966 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:45:27,967 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:45:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-25 05:45:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:45:27,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:27,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:27,996 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487999, now seen corresponding path program 1 times [2018-01-25 05:45:28,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:28,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:28,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:28,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:28,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:28,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:45:28,183 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:28,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:45:28,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:45:28,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:45:28,198 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-01-25 05:45:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:28,492 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-01-25 05:45:28,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:45:28,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-25 05:45:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:28,504 INFO L225 Difference]: With dead ends: 113 [2018-01-25 05:45:28,504 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 05:45:28,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 05:45:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-01-25 05:45:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:45:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 05:45:28,542 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 9 [2018-01-25 05:45:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:28,542 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 05:45:28,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:45:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 05:45:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:45:28,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:28,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:28,543 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1414487998, now seen corresponding path program 1 times [2018-01-25 05:45:28,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:28,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:28,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,545 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:28,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:28,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:28,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:45:28,631 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:28,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:45:28,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:45:28,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:45:28,633 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-01-25 05:45:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:28,775 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2018-01-25 05:45:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:45:28,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-25 05:45:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:28,779 INFO L225 Difference]: With dead ends: 107 [2018-01-25 05:45:28,779 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 05:45:28,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 05:45:28,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 54. [2018-01-25 05:45:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:45:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-25 05:45:28,788 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2018-01-25 05:45:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:28,789 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-25 05:45:28,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:45:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-25 05:45:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:45:28,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:28,790 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:28,790 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:28,790 INFO L82 PathProgramCache]: Analyzing trace with hash 689004913, now seen corresponding path program 1 times [2018-01-25 05:45:28,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:28,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:28,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,792 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:28,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:28,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:28,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:45:28,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:28,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:45:28,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:45:28,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:45:28,854 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-25 05:45:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:28,958 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-01-25 05:45:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:45:28,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 05:45:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:28,961 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:45:28,961 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:45:28,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:45:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-01-25 05:45:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:45:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-01-25 05:45:28,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 18 [2018-01-25 05:45:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:28,971 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-01-25 05:45:28,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:45:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-01-25 05:45:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:45:28,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:28,972 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:28,973 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash 689004914, now seen corresponding path program 1 times [2018-01-25 05:45:28,973 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:28,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:28,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:28,974 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:28,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:29,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:29,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:45:29,122 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:29,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:45:29,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:45:29,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:29,123 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 5 states. [2018-01-25 05:45:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:29,284 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-01-25 05:45:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:45:29,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:45:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:29,286 INFO L225 Difference]: With dead ends: 144 [2018-01-25 05:45:29,286 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 05:45:29,286 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:45:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 05:45:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2018-01-25 05:45:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 05:45:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-01-25 05:45:29,293 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 18 [2018-01-25 05:45:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:29,293 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-01-25 05:45:29,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:45:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-01-25 05:45:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:45:29,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:29,294 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:29,294 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:29,294 INFO L82 PathProgramCache]: Analyzing trace with hash 689036531, now seen corresponding path program 1 times [2018-01-25 05:45:29,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:29,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:29,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:29,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:29,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:29,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:45:29,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:29,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:45:29,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:45:29,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:45:29,345 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 4 states. [2018-01-25 05:45:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:29,412 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-25 05:45:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:45:29,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 05:45:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:29,414 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:45:29,414 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 05:45:29,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 05:45:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2018-01-25 05:45:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 05:45:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-01-25 05:45:29,422 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2018-01-25 05:45:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:29,422 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-01-25 05:45:29,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:45:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-01-25 05:45:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:45:29,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:29,424 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:29,424 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 689036532, now seen corresponding path program 1 times [2018-01-25 05:45:29,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:29,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:29,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:29,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:29,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:29,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:45:29,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:29,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:45:29,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:45:29,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:45:29,490 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 4 states. [2018-01-25 05:45:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:29,583 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2018-01-25 05:45:29,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:45:29,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-25 05:45:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:29,585 INFO L225 Difference]: With dead ends: 112 [2018-01-25 05:45:29,585 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 05:45:29,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 05:45:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2018-01-25 05:45:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:45:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-01-25 05:45:29,593 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 18 [2018-01-25 05:45:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:29,594 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-01-25 05:45:29,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:45:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-01-25 05:45:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:45:29,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:29,595 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:29,595 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash -115685232, now seen corresponding path program 1 times [2018-01-25 05:45:29,595 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:29,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:29,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:29,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:29,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:29,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:45:29,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:29,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:45:29,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:45:29,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:29,650 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-01-25 05:45:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:29,825 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2018-01-25 05:45:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:45:29,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 05:45:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:29,826 INFO L225 Difference]: With dead ends: 90 [2018-01-25 05:45:29,827 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 05:45:29,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:45:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 05:45:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-01-25 05:45:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 05:45:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-01-25 05:45:29,833 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 19 [2018-01-25 05:45:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:29,834 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-01-25 05:45:29,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:45:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-01-25 05:45:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:45:29,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:29,835 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:29,835 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 580005852, now seen corresponding path program 1 times [2018-01-25 05:45:29,836 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:29,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:29,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:29,837 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:29,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:29,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:29,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:45:29,993 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:29,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:45:29,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:45:29,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:45:29,994 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 7 states. [2018-01-25 05:45:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:30,180 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-25 05:45:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:45:30,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 05:45:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:30,181 INFO L225 Difference]: With dead ends: 104 [2018-01-25 05:45:30,181 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 05:45:30,181 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:45:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 05:45:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-01-25 05:45:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 05:45:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2018-01-25 05:45:30,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 23 [2018-01-25 05:45:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:30,189 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2018-01-25 05:45:30,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:45:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2018-01-25 05:45:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:45:30,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:30,190 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:30,190 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash -493029770, now seen corresponding path program 1 times [2018-01-25 05:45:30,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:30,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:30,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:30,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:30,192 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:30,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:30,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:45:30,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:45:30,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:30,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:45:30,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:45:30,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:45:30,288 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 5 states. [2018-01-25 05:45:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:30,365 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-01-25 05:45:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:45:30,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-25 05:45:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:30,366 INFO L225 Difference]: With dead ends: 108 [2018-01-25 05:45:30,366 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:45:30,366 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:45:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:45:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 68. [2018-01-25 05:45:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 05:45:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-25 05:45:30,370 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 23 [2018-01-25 05:45:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:30,371 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-25 05:45:30,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:45:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-25 05:45:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:45:30,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:30,372 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:30,372 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:45:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -951533272, now seen corresponding path program 1 times [2018-01-25 05:45:30,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:30,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:30,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:30,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:30,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:30,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:30,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:30,489 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:45:30,490 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:45:30,492 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [11], [14], [17], [21], [23], [26], [57], [63], [64], [65], [67], [68], [82], [84], [93], [94], [95] [2018-01-25 05:45:30,540 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:45:30,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:46:28,487 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:46:28,488 INFO L268 AbstractInterpreter]: Visited 23 different actions 63 times. Merged at 8 different actions 39 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 05:46:28,499 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:46:28,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:46:28,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:46:28,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:46:28,507 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:46:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:46:28,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:46:28,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-25 05:46:28,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:46:28,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-25 05:46:28,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:46:28,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-01-25 05:46:28,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-25 05:46:28,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:46:28,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-25 05:46:28,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-25 05:46:28,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:46:28,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-25 05:46:28,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-01-25 05:46:28,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-25 05:46:28,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-25 05:46:28,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-25 05:46:28,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:46:28,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-01-25 05:46:28,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:28,876 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2018-01-25 05:46:28,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-25 05:46:28,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-01-25 05:46:28,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-25 05:46:29,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:46:29,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-25 05:46:29,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:46:29,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-01-25 05:46:29,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-25 05:46:29,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:46:29,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-25 05:46:29,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:136 [2018-01-25 05:46:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:46:29,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:46:29,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-01-25 05:46:29,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-01-25 05:46:29,511 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:46:29,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-01-25 05:46:29,523 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:46:29,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-01-25 05:46:29,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:29,527 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:46:29,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:46:29,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:29,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:29,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:46:29,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-01-25 05:46:29,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-01-25 05:46:29,554 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:46:29,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 Received shutdown request... [2018-01-25 05:46:29,573 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:46:29,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-01-25 05:46:29,574 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:46:29,575 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:46:29,578 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:46:29,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:46:29 BoogieIcfgContainer [2018-01-25 05:46:29,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:46:29,579 INFO L168 Benchmark]: Toolchain (without parser) took 62280.19 ms. Allocated memory was 300.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 259.3 MB in the beginning and 265.6 MB in the end (delta: -6.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-25 05:46:29,580 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 300.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:46:29,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.19 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:46:29,580 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:46:29,580 INFO L168 Benchmark]: RCFGBuilder took 355.09 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 226.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:46:29,580 INFO L168 Benchmark]: TraceAbstraction took 61675.55 ms. Allocated memory was 300.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.4 MB in the beginning and 265.6 MB in the end (delta: -41.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-25 05:46:29,582 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.18 ms. Allocated memory is still 300.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.19 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 355.09 ms. Allocated memory is still 300.4 MB. Free memory was 247.4 MB in the beginning and 226.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61675.55 ms. Allocated memory was 300.4 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.4 MB in the beginning and 265.6 MB in the end (delta: -41.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 22 LocStat_MAX_SIZEOF_WEQEDGELABEL : 7 LocStat_NO_SUPPORTING_EQUALITIES : 263 LocStat_NO_SUPPORTING_DISEQUALITIES : 57 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 80.438855 RENAME_VARIABLES(MILLISECONDS) : 42.505488 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.976251 PROJECTAWAY(MILLISECONDS) : 53.133849 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065632 DISJOIN(MILLISECONDS) : 46.301761 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 42.562812 ADD_EQUALITY(MILLISECONDS) : 0.021589 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007194 #CONJOIN_DISJUNCTIVE : 118 #RENAME_VARIABLES : 246 #UNFREEZE : 0 #CONJOIN : 226 #PROJECTAWAY : 141 #ADD_WEAK_EQUALITY : 16 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 205 #ADD_EQUALITY : 63 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 25 error locations. TIMEOUT Result, 61.6s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 376 SDtfs, 746 SDslu, 489 SDs, 0 SdLazy, 615 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 58.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 255 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 12248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-46-29-593.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-46-29-593.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-46-29-593.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-46-29-593.csv Completed graceful shutdown