java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:55:36,240 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:55:36,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:55:36,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:55:36,258 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:55:36,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:55:36,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:55:36,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:55:36,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:55:36,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:55:36,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:55:36,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:55:36,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:55:36,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:55:36,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:55:36,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:55:36,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:55:36,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:55:36,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:55:36,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:55:36,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:55:36,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:55:36,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:55:36,281 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:55:36,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:55:36,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:55:36,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:55:36,284 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:55:36,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:55:36,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:55:36,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:55:36,286 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:55:36,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:55:36,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:55:36,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:55:36,297 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:55:36,298 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:55:36,298 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:55:36,298 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:55:36,298 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:55:36,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:55:36,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:55:36,299 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:55:36,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:55:36,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:55:36,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:55:36,300 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:55:36,300 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:55:36,301 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:55:36,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:55:36,301 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:55:36,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:55:36,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:55:36,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:55:36,302 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:55:36,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:55:36,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:55:36,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:55:36,303 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:55:36,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:55:36,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:55:36,303 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:55:36,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:55:36,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:55:36,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:55:36,304 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:55:36,305 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:55:36,305 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:55:36,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:55:36,350 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:55:36,352 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:55:36,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:55:36,354 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:55:36,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-25 05:55:36,516 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:55:36,523 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:55:36,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:55:36,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:55:36,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:55:36,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7045cace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36, skipping insertion in model container [2018-01-25 05:55:36,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,544 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:55:36,584 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:55:36,701 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:55:36,720 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:55:36,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36 WrapperNode [2018-01-25 05:55:36,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:55:36,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:55:36,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:55:36,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:55:36,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (1/1) ... [2018-01-25 05:55:36,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:55:36,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:55:36,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:55:36,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:55:36,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (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:55:36,841 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:55:36,842 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:55:36,842 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 05:55:36,842 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:55:36,842 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 05:55:36,843 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:55:36,844 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:55:36,844 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:55:37,247 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:55:37,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:55:37 BoogieIcfgContainer [2018-01-25 05:55:37,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:55:37,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:55:37,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:55:37,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:55:37,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:55:36" (1/3) ... [2018-01-25 05:55:37,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d98f575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:55:37, skipping insertion in model container [2018-01-25 05:55:37,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:36" (2/3) ... [2018-01-25 05:55:37,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d98f575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:55:37, skipping insertion in model container [2018-01-25 05:55:37,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:55:37" (3/3) ... [2018-01-25 05:55:37,255 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-01-25 05:55:37,263 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:55:37,269 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-01-25 05:55:37,320 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:55:37,321 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:55:37,321 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:55:37,321 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:55:37,321 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:55:37,321 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:55:37,322 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:55:37,322 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:55:37,323 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:55:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-01-25 05:55:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:55:37,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:37,351 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:37,351 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1146304688, now seen corresponding path program 1 times [2018-01-25 05:55:37,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:37,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:37,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:37,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:37,476 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:55:37,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:37,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:55:37,479 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:37,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:55:37,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:55:37,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:55:37,499 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-01-25 05:55:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:37,605 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-01-25 05:55:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:55:37,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-25 05:55:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:37,614 INFO L225 Difference]: With dead ends: 175 [2018-01-25 05:55:37,614 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 05:55:37,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:55:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 05:55:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-25 05:55:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:55:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-25 05:55:37,647 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 13 [2018-01-25 05:55:37,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:37,647 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-25 05:55:37,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:55:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-25 05:55:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:55:37,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:37,648 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:37,648 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728880, now seen corresponding path program 1 times [2018-01-25 05:55:37,648 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:37,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:37,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:37,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:37,738 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:55:37,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:37,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:55:37,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:37,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:55:37,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:55:37,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:55:37,741 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 5 states. [2018-01-25 05:55:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:37,968 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-01-25 05:55:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:55:37,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:55:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:37,970 INFO L225 Difference]: With dead ends: 130 [2018-01-25 05:55:37,970 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 05:55:37,971 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 05:55:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-01-25 05:55:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 05:55:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-01-25 05:55:37,978 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 15 [2018-01-25 05:55:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:37,979 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-01-25 05:55:37,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:55:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-01-25 05:55:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:55:37,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:37,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:37,979 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728879, now seen corresponding path program 1 times [2018-01-25 05:55:37,980 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:37,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:37,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:37,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:37,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:38,076 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:55:38,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:38,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:55:38,076 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:38,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:55:38,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:55:38,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:55:38,077 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 5 states. [2018-01-25 05:55:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:38,310 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-01-25 05:55:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:55:38,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:55:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:38,312 INFO L225 Difference]: With dead ends: 150 [2018-01-25 05:55:38,312 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 05:55:38,312 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 05:55:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-01-25 05:55:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 05:55:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-01-25 05:55:38,325 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 15 [2018-01-25 05:55:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:38,326 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-01-25 05:55:38,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:55:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-01-25 05:55:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:55:38,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:38,327 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:38,328 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389118, now seen corresponding path program 1 times [2018-01-25 05:55:38,328 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:38,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:38,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:38,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:38,329 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:38,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:38,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:38,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:38,438 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:38,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:38,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:38,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:38,439 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 7 states. [2018-01-25 05:55:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:38,822 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2018-01-25 05:55:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:55:38,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 05:55:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:38,826 INFO L225 Difference]: With dead ends: 236 [2018-01-25 05:55:38,827 INFO L226 Difference]: Without dead ends: 233 [2018-01-25 05:55:38,827 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:55:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-25 05:55:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2018-01-25 05:55:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 05:55:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-01-25 05:55:38,844 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 26 [2018-01-25 05:55:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:38,845 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-01-25 05:55:38,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-01-25 05:55:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:55:38,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:38,846 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:38,847 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389119, now seen corresponding path program 1 times [2018-01-25 05:55:38,847 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:38,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:38,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:38,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:38,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:38,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:38,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:38,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:38,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:38,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:38,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:38,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:38,968 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 7 states. [2018-01-25 05:55:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:39,400 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2018-01-25 05:55:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:55:39,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 05:55:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:39,402 INFO L225 Difference]: With dead ends: 256 [2018-01-25 05:55:39,402 INFO L226 Difference]: Without dead ends: 248 [2018-01-25 05:55:39,402 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:55:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-25 05:55:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 108. [2018-01-25 05:55:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 05:55:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-01-25 05:55:39,415 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 26 [2018-01-25 05:55:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:39,416 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-01-25 05:55:39,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-01-25 05:55:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:55:39,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:39,417 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:39,417 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 356417959, now seen corresponding path program 1 times [2018-01-25 05:55:39,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:39,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:39,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:39,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:39,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:39,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:39,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:39,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:55:39,527 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:39,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:39,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:39,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:39,528 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 7 states. [2018-01-25 05:55:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:39,705 INFO L93 Difference]: Finished difference Result 237 states and 259 transitions. [2018-01-25 05:55:39,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:55:39,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 05:55:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:39,737 INFO L225 Difference]: With dead ends: 237 [2018-01-25 05:55:39,737 INFO L226 Difference]: Without dead ends: 191 [2018-01-25 05:55:39,738 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:55:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-25 05:55:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2018-01-25 05:55:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 05:55:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-01-25 05:55:39,751 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 28 [2018-01-25 05:55:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:39,751 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-01-25 05:55:39,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-01-25 05:55:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:55:39,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:39,753 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:39,753 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash 167170662, now seen corresponding path program 1 times [2018-01-25 05:55:39,753 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:39,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:39,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:39,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:39,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:39,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:39,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:39,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:39,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:39,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:39,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:39,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:39,827 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-01-25 05:55:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:40,001 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2018-01-25 05:55:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:55:40,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:55:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:40,002 INFO L225 Difference]: With dead ends: 163 [2018-01-25 05:55:40,002 INFO L226 Difference]: Without dead ends: 161 [2018-01-25 05:55:40,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:55:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-25 05:55:40,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-01-25 05:55:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 05:55:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-01-25 05:55:40,009 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 30 [2018-01-25 05:55:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:40,010 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-01-25 05:55:40,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-01-25 05:55:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:55:40,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:40,011 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:40,011 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 167170663, now seen corresponding path program 1 times [2018-01-25 05:55:40,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:40,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:40,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:40,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:40,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:40,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:40,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:40,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:40,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:40,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:40,159 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 7 states. [2018-01-25 05:55:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:40,719 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-01-25 05:55:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:55:40,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:55:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:40,721 INFO L225 Difference]: With dead ends: 179 [2018-01-25 05:55:40,721 INFO L226 Difference]: Without dead ends: 174 [2018-01-25 05:55:40,721 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:55:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-25 05:55:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2018-01-25 05:55:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 05:55:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-01-25 05:55:40,734 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 30 [2018-01-25 05:55:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:40,734 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-01-25 05:55:40,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:40,735 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-01-25 05:55:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:55:40,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:40,736 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:40,736 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1351001059, now seen corresponding path program 1 times [2018-01-25 05:55:40,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:40,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:40,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:40,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:40,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:40,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:55:40,830 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:40,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:40,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:40,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:40,831 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 7 states. [2018-01-25 05:55:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:41,014 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2018-01-25 05:55:41,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:55:41,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 05:55:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:41,016 INFO L225 Difference]: With dead ends: 194 [2018-01-25 05:55:41,016 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 05:55:41,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:55:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 05:55:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2018-01-25 05:55:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 05:55:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-01-25 05:55:41,026 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2018-01-25 05:55:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:41,026 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-01-25 05:55:41,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-01-25 05:55:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:55:41,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:41,028 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:41,028 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 730013695, now seen corresponding path program 1 times [2018-01-25 05:55:41,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:41,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:41,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:41,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:41,156 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:55:41,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:41,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:55:41,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:41,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:55:41,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:55:41,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:55:41,157 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2018-01-25 05:55:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:41,441 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-01-25 05:55:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:55:41,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-25 05:55:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:41,442 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:55:41,442 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:55:41,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:55:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:55:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-01-25 05:55:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:55:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-25 05:55:41,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 36 [2018-01-25 05:55:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:41,454 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-25 05:55:41,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:55:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-25 05:55:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:55:41,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:41,456 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:41,456 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 150288015, now seen corresponding path program 1 times [2018-01-25 05:55:41,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:41,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:41,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:41,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:41,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:41,682 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:55:41,683 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-25 05:55:41,685 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [52], [54], [57], [63], [65], [66], [69], [70], [76], [78], [81], [84], [88], [91], [94], [98], [100], [101], [107], [108], [111], [180], [181], [191], [192], [193] [2018-01-25 05:55:41,733 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:55:41,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:56:36,809 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:56:36,810 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:56:36,811 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:56:36,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:56:36,811 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:56:36,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:56:36,817 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:56:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:56:36,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:56:36,868 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:56:36,868 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:56:36,873 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:56:36,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:56:36 BoogieIcfgContainer [2018-01-25 05:56:36,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:56:36,875 INFO L168 Benchmark]: Toolchain (without parser) took 60357.77 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.7 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 419.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:36,876 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:56:36,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.39 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:36,876 INFO L168 Benchmark]: Boogie Preprocessor took 45.39 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:36,877 INFO L168 Benchmark]: RCFGBuilder took 471.09 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 222.9 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:36,877 INFO L168 Benchmark]: TraceAbstraction took 59625.36 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 222.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 376.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:36,879 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.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.39 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.39 ms. Allocated memory is still 305.7 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 471.09 ms. Allocated memory is still 305.7 MB. Free memory was 251.6 MB in the beginning and 222.9 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59625.36 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 222.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 376.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 35 error locations. TIMEOUT Result, 59.5s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 768 SDtfs, 1507 SDslu, 1861 SDs, 0 SdLazy, 1900 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 55.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 524 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 30347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-56-36-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-56-36-886.csv Completed graceful shutdown