java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:33:37,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:33:37,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:33:37,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:33:37,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:33:37,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:33:37,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:33:37,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:33:37,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:33:37,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:33:37,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:33:37,326 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:33:37,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:33:37,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:33:37,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:33:37,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:33:37,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:33:37,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:33:37,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:33:37,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:33:37,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:33:37,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:33:37,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:33:37,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:33:37,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:33:37,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:33:37,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:33:37,347 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:33:37,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:33:37,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:33:37,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:33:37,348 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:33:37,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:33:37,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:33:37,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:33:37,360 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:33:37,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:33:37,361 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:33:37,361 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:33:37,361 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:33:37,361 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:33:37,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:33:37,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:33:37,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:33:37,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:33:37,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:33:37,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:33:37,363 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:33:37,363 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:33:37,364 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:33:37,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:33:37,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:33:37,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:33:37,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:33:37,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:33:37,365 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:33:37,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:33:37,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:33:37,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:33:37,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:33:37,367 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:33:37,367 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:33:37,368 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:33:37,368 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:33:37,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:33:37,420 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:33:37,426 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:33:37,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:33:37,428 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:33:37,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:33:37,640 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:33:37,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:33:37,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:33:37,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:33:37,651 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:33:37,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3a9b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37, skipping insertion in model container [2018-01-25 02:33:37,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,670 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:33:37,710 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:33:37,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:33:37,851 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:33:37,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37 WrapperNode [2018-01-25 02:33:37,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:33:37,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:33:37,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:33:37,860 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:33:37,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... [2018-01-25 02:33:37,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:33:37,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:33:37,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:33:37,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:33:37,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:33:37,949 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:33:37,949 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:33:37,949 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-25 02:33:37,949 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:33:37,949 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:33:37,950 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:33:38,141 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:33:38,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:33:38 BoogieIcfgContainer [2018-01-25 02:33:38,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:33:38,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:33:38,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:33:38,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:33:38,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:33:37" (1/3) ... [2018-01-25 02:33:38,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:33:38, skipping insertion in model container [2018-01-25 02:33:38,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:37" (2/3) ... [2018-01-25 02:33:38,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:33:38, skipping insertion in model container [2018-01-25 02:33:38,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:33:38" (3/3) ... [2018-01-25 02:33:38,147 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:33:38,155 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:33:38,161 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 02:33:38,212 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:33:38,212 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:33:38,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:33:38,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:33:38,213 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:33:38,213 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:33:38,213 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:33:38,213 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:33:38,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:33:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-25 02:33:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:33:38,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:38,244 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:38,244 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-25 02:33:38,253 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:38,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:38,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:38,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:38,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:38,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:33:38,438 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:38,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:33:38,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:33:38,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:33:38,454 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-25 02:33:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:38,537 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-25 02:33:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:33:38,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-25 02:33:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:38,613 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:33:38,613 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 02:33:38,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 02:33:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-25 02:33:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 02:33:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 02:33:38,651 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-25 02:33:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:38,652 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 02:33:38,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:33:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 02:33:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 02:33:38,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:38,652 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:38,652 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-25 02:33:38,653 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:38,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:38,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:38,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:38,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:38,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:33:38,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:38,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:33:38,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:33:38,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:33:38,702 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-25 02:33:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:38,771 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-25 02:33:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:33:38,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-25 02:33:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:38,773 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:33:38,773 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 02:33:38,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:33:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 02:33:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 02:33:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:33:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 02:33:38,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-25 02:33:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:38,782 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 02:33:38,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:33:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 02:33:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:33:38,782 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:38,783 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:38,783 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-25 02:33:38,783 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:38,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:38,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,785 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:38,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:38,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:38,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:33:38,858 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:38,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:33:38,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:33:38,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:33:38,860 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-25 02:33:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:38,938 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 02:33:38,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:33:38,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:33:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:38,940 INFO L225 Difference]: With dead ends: 37 [2018-01-25 02:33:38,940 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 02:33:38,941 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 02:33:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 02:33:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 02:33:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 02:33:38,947 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-25 02:33:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:38,947 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 02:33:38,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:33:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 02:33:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:33:38,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:38,949 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:38,949 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-25 02:33:38,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:38,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:38,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:38,951 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:38,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:39,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:39,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:33:39,141 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:39,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:33:39,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:33:39,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:39,142 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-25 02:33:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:39,218 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-25 02:33:39,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:33:39,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:33:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:39,219 INFO L225 Difference]: With dead ends: 36 [2018-01-25 02:33:39,219 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 02:33:39,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:33:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 02:33:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-25 02:33:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 02:33:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-25 02:33:39,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-25 02:33:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:39,226 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-25 02:33:39,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:33:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-25 02:33:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:33:39,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:39,227 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:39,227 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-25 02:33:39,227 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:39,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:39,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,229 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:39,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:39,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:39,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:33:39,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:39,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:33:39,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:33:39,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:33:39,316 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-25 02:33:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:39,417 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 02:33:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:33:39,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 02:33:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:39,418 INFO L225 Difference]: With dead ends: 35 [2018-01-25 02:33:39,418 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 02:33:39,419 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:33:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 02:33:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-25 02:33:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 02:33:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 02:33:39,424 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-25 02:33:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:39,425 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 02:33:39,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:33:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 02:33:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:33:39,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:39,426 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:39,426 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-25 02:33:39,426 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:39,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:39,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:39,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:39,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:39,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:33:39,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:39,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:33:39,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:33:39,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:33:39,569 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-25 02:33:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:39,708 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-25 02:33:39,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:33:39,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 02:33:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:39,709 INFO L225 Difference]: With dead ends: 42 [2018-01-25 02:33:39,710 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:33:39,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:33:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:33:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-25 02:33:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:33:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 02:33:39,716 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-25 02:33:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:39,716 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 02:33:39,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:33:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 02:33:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:33:39,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:39,718 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] [2018-01-25 02:33:39,718 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-25 02:33:39,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:39,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:39,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,720 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:39,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:39,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:39,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:33:39,835 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:39,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:33:39,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:33:39,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:33:39,836 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-25 02:33:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:39,929 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 02:33:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:33:39,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 02:33:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:39,930 INFO L225 Difference]: With dead ends: 37 [2018-01-25 02:33:39,930 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 02:33:39,931 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:33:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 02:33:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 02:33:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 02:33:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-25 02:33:39,935 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-25 02:33:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:39,936 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-25 02:33:39,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:33:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-25 02:33:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:33:39,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:39,937 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] [2018-01-25 02:33:39,937 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-25 02:33:39,937 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:39,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:39,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:39,938 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:39,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:40,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:40,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:33:40,082 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:40,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:33:40,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:33:40,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:33:40,083 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-25 02:33:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:40,281 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-25 02:33:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:33:40,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 02:33:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:40,283 INFO L225 Difference]: With dead ends: 39 [2018-01-25 02:33:40,283 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 02:33:40,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:33:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 02:33:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 02:33:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 02:33:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 02:33:40,288 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-25 02:33:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:40,288 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 02:33:40,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:33:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 02:33:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:33:40,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:40,289 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:40,289 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-25 02:33:40,289 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:40,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:40,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:40,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:40,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:40,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:40,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:40,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:33:40,538 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:40,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:33:40,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:33:40,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:33:40,540 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-25 02:33:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:40,729 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-25 02:33:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:33:40,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-25 02:33:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:40,730 INFO L225 Difference]: With dead ends: 77 [2018-01-25 02:33:40,730 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:33:40,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:33:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:33:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-25 02:33:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:33:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-25 02:33:40,736 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-25 02:33:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:40,737 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-25 02:33:40,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:33:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-25 02:33:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:33:40,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:40,738 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:40,738 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:33:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-25 02:33:40,738 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:40,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:40,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:40,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:40,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:40,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:41,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:41,032 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:33:41,033 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 02:33:41,035 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [9], [10], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 02:33:41,088 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:33:41,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:34:17,196 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:34:17,198 INFO L268 AbstractInterpreter]: Visited 22 different actions 40 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-25 02:34:17,217 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:34:17,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:34:17,217 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:34:17,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:34:17,225 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:34:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:34:17,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:34:17,302 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 14 treesize of output 11 [2018-01-25 02:34:17,305 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 11 treesize of output 10 [2018-01-25 02:34:17,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:34:17,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:34:17,515 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 20 treesize of output 16 [2018-01-25 02:34:17,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:34:17,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:34:17,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:34:17,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:34:17,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 02:34:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:34:17,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:34:17,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:34:17,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,961 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-25 02:34:17,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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-25 02:34:17,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:17,977 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:34:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:34:18,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:34:18,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) [2018-01-25 02:34:18,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:34:18,027 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:34:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:34:18,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:34:18,122 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 6 treesize of output 5 [2018-01-25 02:34:18,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:34:18,261 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 16 treesize of output 13 [2018-01-25 02:34:18,264 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 13 treesize of output 12 [2018-01-25 02:34:18,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:34:18,449 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 19 treesize of output 15 [2018-01-25 02:34:18,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:34:18,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:34:18,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:34:18,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:34:18,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 02:34:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:34:18,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:34:18,917 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-25 02:34:18,926 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-25 02:34:18,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:34:18,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:34:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:34:19,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:34:19,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-25 02:34:19,030 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:34:19,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:34:19,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:34:19,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 02:34:19,032 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-25 02:34:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:34:20,003 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 02:34:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:34:20,003 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-25 02:34:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:34:20,006 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:34:20,006 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:34:20,007 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 02:34:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:34:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-25 02:34:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:34:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-25 02:34:20,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-25 02:34:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:34:20,018 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-25 02:34:20,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:34:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-25 02:34:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:34:20,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:34:20,019 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:34:20,019 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:34:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-25 02:34:20,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:34:20,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:34:20,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:34:20,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:34:20,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:34:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:34:20,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:34:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:34:20,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:34:20,358 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:34:20,359 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 02:34:20,359 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [10], [12], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-25 02:34:20,360 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:34:20,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:34:33,047 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:34:33,048 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:34:33,048 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:34:33,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:34:33,048 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:34:33,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:34:33,055 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:34:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:34:33,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:34:33,080 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:34:33,080 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:34:33,085 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:34:33,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:34:33 BoogieIcfgContainer [2018-01-25 02:34:33,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:34:33,086 INFO L168 Benchmark]: Toolchain (without parser) took 55445.97 ms. Allocated memory was 314.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 273.0 MB in the beginning and 1.0 GB in the end (delta: -752.8 MB). Peak memory consumption was 572.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:33,087 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 314.0 MB. Free memory is still 279.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:34:33,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.59 ms. Allocated memory is still 314.0 MB. Free memory was 273.0 MB in the beginning and 262.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:33,088 INFO L168 Benchmark]: Boogie Preprocessor took 37.40 ms. Allocated memory is still 314.0 MB. Free memory was 262.9 MB in the beginning and 260.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:33,091 INFO L168 Benchmark]: RCFGBuilder took 244.00 ms. Allocated memory is still 314.0 MB. Free memory was 260.9 MB in the beginning and 244.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:33,091 INFO L168 Benchmark]: TraceAbstraction took 54943.24 ms. Allocated memory was 314.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 244.0 MB in the beginning and 1.0 GB in the end (delta: -781.7 MB). Peak memory consumption was 543.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:33,093 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.20 ms. Allocated memory is still 314.0 MB. Free memory is still 279.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.59 ms. Allocated memory is still 314.0 MB. Free memory was 273.0 MB in the beginning and 262.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.40 ms. Allocated memory is still 314.0 MB. Free memory was 262.9 MB in the beginning and 260.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 244.00 ms. Allocated memory is still 314.0 MB. Free memory was 260.9 MB in the beginning and 244.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54943.24 ms. Allocated memory was 314.0 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 244.0 MB in the beginning and 1.0 GB in the end (delta: -781.7 MB). Peak memory consumption was 543.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 244 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 12.215662 RENAME_VARIABLES(MILLISECONDS) : 2.017064 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.138119 PROJECTAWAY(MILLISECONDS) : 697.618780 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.077575 DISJOIN(MILLISECONDS) : 0.473177 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.073925 ADD_EQUALITY(MILLISECONDS) : 0.050771 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015131 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 128 #UNFREEZE : 0 #CONJOIN : 126 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. TIMEOUT Result, 54.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 292 SDtfs, 284 SDslu, 899 SDs, 0 SdLazy, 653 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 48.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 256 ConstructedInterpolants, 9 QuantifiedInterpolants, 34239 SizeOfPredicates, 27 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 3/18 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/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-34-33-108.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-34-33-108.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-34-33-108.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-34-33-108.csv Completed graceful shutdown