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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:44:31,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:44:31,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:44:31,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:44:31,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:44:31,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:44:31,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:44:31,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:44:31,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:44:31,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:44:31,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:44:31,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:44:31,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:44:31,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:44:31,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:44:31,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:44:31,363 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:44:31,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:44:31,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:44:31,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:44:31,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:44:31,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:44:31,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:44:31,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:44:31,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:44:31,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:44:31,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:44:31,374 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:44:31,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:44:31,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:44:31,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:44:31,376 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_mostprecise.epf [2018-01-24 19:44:31,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:44:31,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:44:31,385 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:44:31,385 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:44:31,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:44:31,385 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:44:31,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:44:31,386 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:44:31,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:44:31,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:44:31,386 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:44:31,386 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:44:31,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:44:31,388 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:44:31,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:44:31,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:44:31,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:44:31,388 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:44:31,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:44:31,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:44:31,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:44:31,390 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:44:31,390 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:44:31,390 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:44:31,390 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:44:31,391 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:44:31,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:44:31,434 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:44:31,438 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:44:31,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:44:31,439 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:44:31,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:44:31,594 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:44:31,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:44:31,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:44:31,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:44:31,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:44:31,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fee6ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31, skipping insertion in model container [2018-01-24 19:44:31,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,619 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:44:31,656 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:44:31,775 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:44:31,795 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:44:31,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31 WrapperNode [2018-01-24 19:44:31,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:44:31,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:44:31,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:44:31,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:44:31,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (1/1) ... [2018-01-24 19:44:31,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:44:31,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:44:31,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:44:31,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:44:31,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (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 19:44:31,898 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:44:31,899 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:44:31,899 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 19:44:31,899 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:44:31,899 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:44:31,899 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 19:44:31,900 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:44:31,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:44:31,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:44:32,145 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:44:32,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:44:32 BoogieIcfgContainer [2018-01-24 19:44:32,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:44:32,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:44:32,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:44:32,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:44:32,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:44:31" (1/3) ... [2018-01-24 19:44:32,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b6677b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:44:32, skipping insertion in model container [2018-01-24 19:44:32,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:44:31" (2/3) ... [2018-01-24 19:44:32,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b6677b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:44:32, skipping insertion in model container [2018-01-24 19:44:32,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:44:32" (3/3) ... [2018-01-24 19:44:32,153 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:44:32,160 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:44:32,166 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 19:44:32,212 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:44:32,212 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:44:32,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:44:32,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:44:32,213 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:44:32,213 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:44:32,213 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:44:32,213 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:44:32,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:44:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 19:44:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:44:32,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:32,242 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:44:32,243 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-01-24 19:44:32,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:32,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:32,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:32,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:32,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:32,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:32,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:32,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:44:32,490 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:32,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:44:32,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:44:32,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:44:32,566 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 19:44:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:32,696 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 19:44:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:44:32,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:44:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:32,705 INFO L225 Difference]: With dead ends: 78 [2018-01-24 19:44:32,705 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:44:32,708 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 19:44:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:44:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:44:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:44:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 19:44:32,737 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-01-24 19:44:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:32,737 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 19:44:32,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:44:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 19:44:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:44:32,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:32,738 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:44:32,738 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-01-24 19:44:32,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:32,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:32,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:32,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:32,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:32,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:32,908 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 19:44:32,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:32,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:44:32,909 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:32,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:44:32,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:44:32,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:44:32,911 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-01-24 19:44:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,043 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-24 19:44:33,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:44:33,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:44:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,045 INFO L225 Difference]: With dead ends: 52 [2018-01-24 19:44:33,045 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 19:44:33,046 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:44:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 19:44:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 19:44:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:44:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 19:44:33,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-01-24 19:44:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,053 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 19:44:33,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:44:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 19:44:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:44:33,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,054 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:44:33,055 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-01-24 19:44:33,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:33,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:33,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:44:33,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:33,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:44:33,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:44:33,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:44:33,102 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-01-24 19:44:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,180 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 19:44:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:44:33,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:44:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,182 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:44:33,182 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:44:33,182 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 19:44:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:44:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:44:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:44:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 19:44:33,189 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-01-24 19:44:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,190 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 19:44:33,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:44:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 19:44:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:44:33,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,191 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:44:33,191 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-01-24 19:44:33,191 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:33,286 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 19:44:33,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:33,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:44:33,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:33,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:44:33,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:44:33,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:44:33,288 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-24 19:44:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,345 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 19:44:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:44:33,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:44:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,349 INFO L225 Difference]: With dead ends: 50 [2018-01-24 19:44:33,349 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:44:33,349 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:44:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:44:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:44:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:44:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 19:44:33,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-24 19:44:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,357 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 19:44:33,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:44:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 19:44:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:44:33,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,358 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 19:44:33,358 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-01-24 19:44:33,358 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,360 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:33,412 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 19:44:33,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:33,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:44:33,412 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:33,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:44:33,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:44:33,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:44:33,413 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-24 19:44:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,483 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 19:44:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:44:33,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 19:44:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,484 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:44:33,485 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 19:44:33,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:44:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 19:44:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 19:44:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:44:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 19:44:33,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-01-24 19:44:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,490 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 19:44:33,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:44:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 19:44:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:44:33,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,491 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 19:44:33,491 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-01-24 19:44:33,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,493 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:33,615 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 19:44:33,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:33,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:44:33,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:33,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:44:33,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:44:33,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:44:33,617 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-01-24 19:44:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,718 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-01-24 19:44:33,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:44:33,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:44:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,721 INFO L225 Difference]: With dead ends: 69 [2018-01-24 19:44:33,722 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 19:44:33,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:44:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 19:44:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-24 19:44:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 19:44:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 19:44:33,730 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-01-24 19:44:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,730 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 19:44:33,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:44:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 19:44:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:44:33,731 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,732 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] [2018-01-24 19:44:33,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-01-24 19:44:33,732 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:33,780 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 19:44:33,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:33,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:44:33,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:33,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:44:33,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:44:33,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:44:33,781 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-01-24 19:44:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:33,844 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 19:44:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:44:33,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 19:44:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:33,846 INFO L225 Difference]: With dead ends: 55 [2018-01-24 19:44:33,846 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:44:33,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:44:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:44:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 19:44:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:44:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 19:44:33,853 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-01-24 19:44:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:33,853 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 19:44:33,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:44:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 19:44:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 19:44:33,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:33,855 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] [2018-01-24 19:44:33,855 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-01-24 19:44:33,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:33,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:33,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:33,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:33,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:34,048 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 19:44:34,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:34,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:44:34,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:34,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:44:34,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:44:34,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:44:34,050 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-01-24 19:44:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:34,190 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-24 19:44:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:44:34,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 19:44:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:34,192 INFO L225 Difference]: With dead ends: 62 [2018-01-24 19:44:34,192 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 19:44:34,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:44:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 19:44:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-24 19:44:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 19:44:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 19:44:34,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-01-24 19:44:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:34,201 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 19:44:34,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:44:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 19:44:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:44:34,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:34,202 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] [2018-01-24 19:44:34,202 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-01-24 19:44:34,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:34,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:34,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:34,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:34,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:34,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:44:34,256 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:34,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:44:34,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:44:34,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:44:34,257 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-01-24 19:44:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:34,267 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 19:44:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:44:34,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 19:44:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:34,269 INFO L225 Difference]: With dead ends: 85 [2018-01-24 19:44:34,269 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 19:44:34,270 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:44:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 19:44:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 19:44:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 19:44:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-24 19:44:34,276 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-01-24 19:44:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:34,277 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-24 19:44:34,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:44:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-24 19:44:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:44:34,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:34,278 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] [2018-01-24 19:44:34,278 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:34,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-01-24 19:44:34,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:34,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:34,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:34,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:34,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:44:34,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 19:44:34,487 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:44:34,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 19:44:34,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 19:44:34,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:44:34,488 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-01-24 19:44:34,702 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 19 DAG size of output 18 [2018-01-24 19:44:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:34,942 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-24 19:44:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 19:44:34,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 19:44:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:34,943 INFO L225 Difference]: With dead ends: 122 [2018-01-24 19:44:34,943 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 19:44:34,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-01-24 19:44:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 19:44:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 19:44:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 19:44:34,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 19:44:34,954 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-01-24 19:44:34,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:34,954 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 19:44:34,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 19:44:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 19:44:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 19:44:34,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:34,956 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] [2018-01-24 19:44:34,956 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:44:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-01-24 19:44:34,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:34,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:44:34,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:34,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:34,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:35,302 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 19:44:35,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:44:35,322 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:44:35,323 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 19:44:35,325 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [61], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 19:44:35,375 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:44:35,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:45:33,055 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:45:33,057 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 19:45:33,093 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:45:33,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:33,093 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 19:45:33,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:33,105 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:45:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:33,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:45:33,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 19:45:33,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:45:33,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 19:45:33,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 19:45:33,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-24 19:45:33,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-01-24 19:45:33,601 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-01-24 19:45:33,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:45:33,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2018-01-24 19:45:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:45:33,853 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:45:33,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:45:33,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:45:33,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:33,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 19:45:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:45:34,012 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 19:45:34,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [13] total 29 [2018-01-24 19:45:34,012 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:34,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 19:45:34,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 19:45:34,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-01-24 19:45:34,013 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 12 states. Received shutdown request... [2018-01-24 19:45:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:45:34,119 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:45:34,122 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:45:34,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:45:34 BoogieIcfgContainer [2018-01-24 19:45:34,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:45:34,124 INFO L168 Benchmark]: Toolchain (without parser) took 62529.41 ms. Allocated memory was 298.3 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 257.2 MB in the beginning and 482.1 MB in the end (delta: -224.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-24 19:45:34,124 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 298.3 MB. Free memory is still 263.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:45:34,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.73 ms. Allocated memory is still 298.3 MB. Free memory was 257.2 MB in the beginning and 247.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:45:34,125 INFO L168 Benchmark]: Boogie Preprocessor took 32.28 ms. Allocated memory is still 298.3 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:45:34,125 INFO L168 Benchmark]: RCFGBuilder took 309.97 ms. Allocated memory is still 298.3 MB. Free memory was 245.1 MB in the beginning and 226.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:45:34,125 INFO L168 Benchmark]: TraceAbstraction took 61976.42 ms. Allocated memory was 298.3 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 226.1 MB in the beginning and 482.1 MB in the end (delta: -255.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 19:45:34,127 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 298.3 MB. Free memory is still 263.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.73 ms. Allocated memory is still 298.3 MB. Free memory was 257.2 MB in the beginning and 247.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.28 ms. Allocated memory is still 298.3 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 309.97 ms. Allocated memory is still 298.3 MB. Free memory was 245.1 MB in the beginning and 226.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61976.42 ms. Allocated memory was 298.3 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 226.1 MB in the beginning and 482.1 MB in the end (delta: -255.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 286 LocStat_NO_SUPPORTING_DISEQUALITIES : 54 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.420722 RENAME_VARIABLES(MILLISECONDS) : 0.890155 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.354374 PROJECTAWAY(MILLISECONDS) : 21.257976 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091175 DISJOIN(MILLISECONDS) : 0.470573 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.925916 ADD_EQUALITY(MILLISECONDS) : 0.014312 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009898 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 135 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 7 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 61.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 427 SDtfs, 413 SDslu, 826 SDs, 0 SdLazy, 561 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 57.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 248 ConstructedInterpolants, 1 QuantifiedInterpolants, 26642 SizeOfPredicates, 17 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 8/10 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/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-45-34-135.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-45-34-135.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-45-34-135.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-45-34-135.csv Completed graceful shutdown