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.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:17:18,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:17:18,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:17:18,377 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:17:18,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:17:18,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:17:18,380 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:17:18,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:17:18,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:17:18,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:17:18,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:17:18,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:17:18,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:17:18,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:17:18,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:17:18,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:17:18,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:17:18,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:17:18,396 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:17:18,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:17:18,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:17:18,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:17:18,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:17:18,401 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:17:18,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:17:18,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:17:18,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:17:18,404 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:17:18,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:17:18,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:17:18,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:17:18,405 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.epf [2018-01-24 16:17:18,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:17:18,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:17:18,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:17:18,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:17:18,415 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:17:18,416 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:17:18,416 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:17:18,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:17:18,416 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:17:18,416 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:17:18,416 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:17:18,417 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:17:18,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:17:18,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:17:18,418 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:17:18,418 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:17:18,418 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:17:18,418 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:17:18,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:17:18,419 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:17:18,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:17:18,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:17:18,419 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:17:18,419 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:17:18,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:17:18,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:17:18,420 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:17:18,420 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:17:18,421 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:17:18,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:17:18,465 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:17:18,468 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:17:18,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:17:18,469 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:17:18,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:17:18,654 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:17:18,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:17:18,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:17:18,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:17:18,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:17:18,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e82129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18, skipping insertion in model container [2018-01-24 16:17:18,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,681 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:17:18,723 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:17:18,837 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:17:18,854 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:17:18,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18 WrapperNode [2018-01-24 16:17:18,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:17:18,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:17:18,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:17:18,862 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:17:18,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (1/1) ... [2018-01-24 16:17:18,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:17:18,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:17:18,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:17:18,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:17:18,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (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-24 16:17:18,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:17:18,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:17:18,965 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:17:18,965 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:17:18,965 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:17:18,966 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:17:18,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:17:19,449 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:17:19,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:17:19 BoogieIcfgContainer [2018-01-24 16:17:19,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:17:19,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:17:19,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:17:19,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:17:19,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:17:18" (1/3) ... [2018-01-24 16:17:19,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259cd659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:17:19, skipping insertion in model container [2018-01-24 16:17:19,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:17:18" (2/3) ... [2018-01-24 16:17:19,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259cd659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:17:19, skipping insertion in model container [2018-01-24 16:17:19,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:17:19" (3/3) ... [2018-01-24 16:17:19,457 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-01-24 16:17:19,463 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:17:19,470 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-24 16:17:19,509 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:17:19,509 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:17:19,510 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:17:19,510 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:17:19,510 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:17:19,510 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:17:19,510 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:17:19,510 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:17:19,511 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:17:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-01-24 16:17:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:17:19,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:19,535 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:19,535 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775718, now seen corresponding path program 1 times [2018-01-24 16:17:19,541 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:19,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:19,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:19,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:19,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:19,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:19,694 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-24 16:17:19,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:19,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:17:19,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:19,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:17:19,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:17:19,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:17:19,711 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2018-01-24 16:17:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:20,009 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2018-01-24 16:17:20,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:17:20,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:17:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:20,021 INFO L225 Difference]: With dead ends: 238 [2018-01-24 16:17:20,021 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 16:17:20,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 16:17:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2018-01-24 16:17:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 16:17:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-01-24 16:17:20,065 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 8 [2018-01-24 16:17:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:20,065 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-01-24 16:17:20,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:17:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-01-24 16:17:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 16:17:20,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:20,066 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:20,066 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1807775717, now seen corresponding path program 1 times [2018-01-24 16:17:20,067 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:20,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:20,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:20,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:20,138 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-24 16:17:20,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:20,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:17:20,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:20,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:17:20,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:17:20,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:17:20,140 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 4 states. [2018-01-24 16:17:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:20,318 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-01-24 16:17:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:17:20,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 16:17:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:20,320 INFO L225 Difference]: With dead ends: 133 [2018-01-24 16:17:20,320 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 16:17:20,321 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 16:17:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2018-01-24 16:17:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 16:17:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-01-24 16:17:20,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 8 [2018-01-24 16:17:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:20,335 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-01-24 16:17:20,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:17:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-01-24 16:17:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:17:20,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:20,336 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:20,337 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075710, now seen corresponding path program 1 times [2018-01-24 16:17:20,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:20,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:20,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:20,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:20,416 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-24 16:17:20,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:20,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:17:20,417 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:20,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:17:20,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:17:20,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:17:20,418 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 4 states. [2018-01-24 16:17:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:20,590 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-01-24 16:17:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:17:20,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:17:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:20,610 INFO L225 Difference]: With dead ends: 126 [2018-01-24 16:17:20,610 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 16:17:20,611 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 16:17:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2018-01-24 16:17:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 16:17:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2018-01-24 16:17:20,619 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 14 [2018-01-24 16:17:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:20,619 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2018-01-24 16:17:20,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:17:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2018-01-24 16:17:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:17:20,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:20,620 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:20,621 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1410075709, now seen corresponding path program 1 times [2018-01-24 16:17:20,621 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:20,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:20,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,622 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:20,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:20,727 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-24 16:17:20,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:20,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:17:20,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:20,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:17:20,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:17:20,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:20,728 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand 5 states. [2018-01-24 16:17:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:20,898 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-01-24 16:17:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:17:20,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:17:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:20,900 INFO L225 Difference]: With dead ends: 182 [2018-01-24 16:17:20,901 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 16:17:20,901 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-24 16:17:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 16:17:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-01-24 16:17:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 16:17:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-01-24 16:17:20,914 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 14 [2018-01-24 16:17:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:20,915 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-01-24 16:17:20,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:17:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-01-24 16:17:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:17:20,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:20,916 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:20,916 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -444857017, now seen corresponding path program 1 times [2018-01-24 16:17:20,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:20,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:20,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:20,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:20,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:21,030 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-24 16:17:21,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:21,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:17:21,030 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:21,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:17:21,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:17:21,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:21,031 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 5 states. [2018-01-24 16:17:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:21,230 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-01-24 16:17:21,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:17:21,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:17:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:21,232 INFO L225 Difference]: With dead ends: 131 [2018-01-24 16:17:21,232 INFO L226 Difference]: Without dead ends: 130 [2018-01-24 16:17:21,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:17:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-24 16:17:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-01-24 16:17:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 16:17:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-01-24 16:17:21,248 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 18 [2018-01-24 16:17:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:21,248 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-01-24 16:17:21,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:17:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-01-24 16:17:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:17:21,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:21,249 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:21,250 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -444857018, now seen corresponding path program 1 times [2018-01-24 16:17:21,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:21,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:21,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:21,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:21,306 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-24 16:17:21,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:21,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:17:21,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:21,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:17:21,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:17:21,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:17:21,308 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 5 states. [2018-01-24 16:17:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:21,434 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-01-24 16:17:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:17:21,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:17:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:21,435 INFO L225 Difference]: With dead ends: 132 [2018-01-24 16:17:21,435 INFO L226 Difference]: Without dead ends: 131 [2018-01-24 16:17:21,436 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:17:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-24 16:17:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-01-24 16:17:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 16:17:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-24 16:17:21,444 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 18 [2018-01-24 16:17:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:21,445 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-24 16:17:21,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:17:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-24 16:17:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:17:21,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:21,445 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:21,445 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash -418196060, now seen corresponding path program 1 times [2018-01-24 16:17:21,446 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:21,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:21,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:21,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:21,508 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-24 16:17:21,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:21,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:17:21,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:21,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:17:21,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:17:21,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:17:21,509 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 6 states. [2018-01-24 16:17:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:21,804 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-24 16:17:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:17:21,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:17:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:21,806 INFO L225 Difference]: With dead ends: 189 [2018-01-24 16:17:21,806 INFO L226 Difference]: Without dead ends: 188 [2018-01-24 16:17:21,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:17:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-24 16:17:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-01-24 16:17:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-24 16:17:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-01-24 16:17:21,814 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 18 [2018-01-24 16:17:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:21,815 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-01-24 16:17:21,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:17:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-01-24 16:17:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:17:21,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:21,816 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:21,816 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -418196059, now seen corresponding path program 1 times [2018-01-24 16:17:21,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:21,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:21,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:21,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:21,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:21,880 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-24 16:17:21,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:21,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:17:21,881 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:21,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:17:21,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:17:21,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:17:21,882 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 6 states. [2018-01-24 16:17:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:22,100 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2018-01-24 16:17:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:17:22,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:17:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:22,101 INFO L225 Difference]: With dead ends: 216 [2018-01-24 16:17:22,101 INFO L226 Difference]: Without dead ends: 210 [2018-01-24 16:17:22,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:17:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-24 16:17:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 112. [2018-01-24 16:17:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 16:17:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-24 16:17:22,108 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 18 [2018-01-24 16:17:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:22,108 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-24 16:17:22,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:17:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-24 16:17:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:17:22,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:22,109 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:22,109 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379848, now seen corresponding path program 1 times [2018-01-24 16:17:22,109 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:22,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:22,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:22,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:22,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:22,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:17:22,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:22,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:17:22,274 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:22,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:17:22,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:17:22,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:17:22,275 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 11 states. [2018-01-24 16:17:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:22,672 INFO L93 Difference]: Finished difference Result 197 states and 204 transitions. [2018-01-24 16:17:22,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:17:22,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 16:17:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:22,674 INFO L225 Difference]: With dead ends: 197 [2018-01-24 16:17:22,674 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 16:17:22,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:17:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 16:17:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2018-01-24 16:17:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:17:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-24 16:17:22,683 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 33 [2018-01-24 16:17:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:22,684 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-24 16:17:22,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:17:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-24 16:17:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:17:22,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:22,685 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:22,685 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1163379847, now seen corresponding path program 1 times [2018-01-24 16:17:22,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:22,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:22,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:22,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:22,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:22,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:22,880 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-24 16:17:22,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:17:22,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:17:22,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:17:22,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:17:22,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:17:22,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:17:22,881 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 11 states. [2018-01-24 16:17:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:17:23,454 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-01-24 16:17:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:17:23,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 16:17:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:17:23,456 INFO L225 Difference]: With dead ends: 227 [2018-01-24 16:17:23,456 INFO L226 Difference]: Without dead ends: 226 [2018-01-24 16:17:23,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-01-24 16:17:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-24 16:17:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 135. [2018-01-24 16:17:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 16:17:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-01-24 16:17:23,468 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 33 [2018-01-24 16:17:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:17:23,468 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-01-24 16:17:23,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:17:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-01-24 16:17:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:17:23,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:17:23,470 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:17:23,471 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr44EnsuresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 16:17:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash 713889595, now seen corresponding path program 1 times [2018-01-24 16:17:23,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:17:23,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:23,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:17:23,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:17:23,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:17:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:17:23,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:17:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:17:23,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:17:23,673 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:17:23,674 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 16:17:23,676 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [52], [55], [56], [59], [62], [65], [69], [74], [78], [86], [88], [89], [95], [99], [100], [107], [111], [117], [120], [226], [227], [231], [232], [233] [2018-01-24 16:17:23,738 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:17:23,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 16:18:21,773 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 16:18:21,774 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 16:18:21,775 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:18:21,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:18:21,775 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-24 16:18:21,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:18:21,783 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:18:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:18:21,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:18:21,826 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:18:21,826 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:18:21,832 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:18:21,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:18:21 BoogieIcfgContainer [2018-01-24 16:18:21,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:18:21,834 INFO L168 Benchmark]: Toolchain (without parser) took 63179.23 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 264.0 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 386.4 MB. Max. memory is 5.3 GB. [2018-01-24 16:18:21,835 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:18:21,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.13 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 250.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:18:21,836 INFO L168 Benchmark]: Boogie Preprocessor took 48.03 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:18:21,836 INFO L168 Benchmark]: RCFGBuilder took 539.04 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 218.9 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:18:21,837 INFO L168 Benchmark]: TraceAbstraction took 62382.71 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 218.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 341.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:18:21,839 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 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.13 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 250.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.03 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 539.04 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 218.9 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62382.71 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 218.9 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 341.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 45 error locations. TIMEOUT Result, 62.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 697 SDtfs, 1800 SDslu, 1500 SDs, 0 SdLazy, 1975 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 58.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 408 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 23012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-18-21-849.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-18-21-849.csv Completed graceful shutdown