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_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:41:36,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:41:36,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:41:36,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:41:36,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:41:36,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:41:36,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:41:36,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:41:36,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:41:36,306 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:41:36,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:41:36,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:41:36,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:41:36,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:41:36,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:41:36,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:41:36,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:41:36,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:41:36,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:41:36,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:41:36,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:41:36,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:41:36,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:41:36,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:41:36,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:41:36,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:41:36,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:41:36,325 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:41:36,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:41:36,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:41:36,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:41:36,327 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_imprecise.epf [2018-01-24 16:41:36,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:41:36,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:41:36,337 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:41:36,338 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:41:36,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:41:36,338 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:41:36,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:41:36,338 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:41:36,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:41:36,339 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:41:36,339 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:41:36,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:41:36,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:41:36,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:41:36,340 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:41:36,340 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:41:36,341 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:41:36,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:41:36,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:41:36,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:41:36,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:41:36,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:41:36,342 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:41:36,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:41:36,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:41:36,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:41:36,343 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:41:36,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:41:36,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:41:36,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:41:36,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:41:36,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:41:36,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:41:36,344 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:41:36,345 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:41:36,345 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:41:36,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:41:36,392 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:41:36,395 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:41:36,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:41:36,397 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:41:36,398 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-24 16:41:36,565 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:41:36,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:41:36,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:41:36,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:41:36,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:41:36,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647aa831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36, skipping insertion in model container [2018-01-24 16:41:36,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,597 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:41:36,638 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:41:36,743 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:41:36,758 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:41:36,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36 WrapperNode [2018-01-24 16:41:36,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:41:36,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:41:36,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:41:36,764 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:41:36,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... [2018-01-24 16:41:36,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:41:36,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:41:36,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:41:36,792 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:41:36,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:41:36,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:41:36,845 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:41:36,845 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 16:41:36,845 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:41:36,845 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:41:36,845 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:41:36,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:41:36,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:41:36,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:41:37,030 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:41:37,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:41:37 BoogieIcfgContainer [2018-01-24 16:41:37,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:41:37,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:41:37,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:41:37,033 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:41:37,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:41:36" (1/3) ... [2018-01-24 16:41:37,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6c4517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:41:37, skipping insertion in model container [2018-01-24 16:41:37,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:36" (2/3) ... [2018-01-24 16:41:37,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6c4517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:41:37, skipping insertion in model container [2018-01-24 16:41:37,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:41:37" (3/3) ... [2018-01-24 16:41:37,036 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:41:37,042 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:41:37,047 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 16:41:37,091 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:41:37,091 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:41:37,091 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:41:37,091 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:41:37,091 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:41:37,091 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:41:37,092 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:41:37,092 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:41:37,092 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:41:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 16:41:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:41:37,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:37,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:37,111 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 16:41:37,119 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:37,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:37,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,162 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:37,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:37,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:37,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:41:37,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:37,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:41:37,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:41:37,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:41:37,294 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 16:41:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:37,391 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 16:41:37,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:41:37,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 16:41:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:37,402 INFO L225 Difference]: With dead ends: 57 [2018-01-24 16:41:37,402 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 16:41:37,405 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-24 16:41:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 16:41:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 16:41:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:41:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 16:41:37,499 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 16:41:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:37,499 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 16:41:37,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:41:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 16:41:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 16:41:37,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:37,500 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:37,500 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 16:41:37,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:37,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:37,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:37,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:37,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:37,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:41:37,540 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:37,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:41:37,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:41:37,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:41:37,543 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 16:41:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:37,606 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 16:41:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:41:37,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 16:41:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:37,607 INFO L225 Difference]: With dead ends: 40 [2018-01-24 16:41:37,607 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 16:41:37,608 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-24 16:41:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 16:41:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 16:41:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:41:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 16:41:37,615 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 16:41:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:37,615 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 16:41:37,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:41:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 16:41:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:41:37,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:37,616 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:37,616 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:37,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 16:41:37,617 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:37,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:37,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:37,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:37,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:37,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:41:37,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:37,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:41:37,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:41:37,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:41:37,684 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 16:41:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:37,758 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 16:41:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:41:37,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:41:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:37,759 INFO L225 Difference]: With dead ends: 37 [2018-01-24 16:41:37,760 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 16:41:37,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 16:41:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 16:41:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:41:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:41:37,766 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 16:41:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:37,766 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:41:37,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:41:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:41:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:41:37,767 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:37,767 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:37,768 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 16:41:37,768 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:37,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:37,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:37,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:37,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:37,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:41:37,907 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:37,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:41:37,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:41:37,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:37,908 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 16:41:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:37,962 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 16:41:37,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:41:37,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:41:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:37,963 INFO L225 Difference]: With dead ends: 36 [2018-01-24 16:41:37,964 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 16:41:37,964 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-24 16:41:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 16:41:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 16:41:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 16:41:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 16:41:37,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 16:41:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:37,970 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 16:41:37,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:41:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 16:41:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:41:37,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:37,971 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-24 16:41:37,971 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-24 16:41:37,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:37,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:37,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:37,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:37,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:38,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:38,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:41:38,053 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:38,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:41:38,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:41:38,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:38,054 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 16:41:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:38,136 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 16:41:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:41:38,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:41:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:38,137 INFO L225 Difference]: With dead ends: 35 [2018-01-24 16:41:38,137 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 16:41:38,137 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-24 16:41:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 16:41:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 16:41:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 16:41:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 16:41:38,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-24 16:41:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:38,142 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 16:41:38,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:41:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 16:41:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:41:38,143 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:38,143 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-24 16:41:38,143 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:38,144 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-24 16:41:38,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:38,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:38,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:38,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:38,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:38,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:41:38,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:38,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:41:38,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:41:38,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:41:38,252 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-24 16:41:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:38,371 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 16:41:38,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:41:38,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 16:41:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:38,372 INFO L225 Difference]: With dead ends: 42 [2018-01-24 16:41:38,373 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:41:38,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:41:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:41:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-24 16:41:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:41:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 16:41:38,379 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-24 16:41:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:38,380 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 16:41:38,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:41:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 16:41:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:41:38,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:38,381 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-24 16:41:38,381 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-24 16:41:38,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:38,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:38,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:38,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:38,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:38,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:41:38,480 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:38,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:41:38,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:41:38,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:41:38,481 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-24 16:41:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:38,568 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 16:41:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:41:38,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 16:41:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:38,617 INFO L225 Difference]: With dead ends: 37 [2018-01-24 16:41:38,617 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 16:41:38,618 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-24 16:41:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 16:41:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 16:41:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 16:41:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 16:41:38,623 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-24 16:41:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:38,624 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 16:41:38,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:41:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 16:41:38,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:41:38,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:38,625 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-24 16:41:38,625 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:38,625 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-24 16:41:38,625 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:38,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:38,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:38,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:38,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:38,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:41:38,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:38,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:41:38,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:41:38,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:41:38,769 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-24 16:41:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:38,907 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 16:41:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:41:38,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 16:41:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:38,908 INFO L225 Difference]: With dead ends: 39 [2018-01-24 16:41:38,908 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 16:41:38,909 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-24 16:41:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 16:41:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 16:41:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:41:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 16:41:38,913 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-24 16:41:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:38,913 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 16:41:38,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:41:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 16:41:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:41:38,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:38,914 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-24 16:41:38,914 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-24 16:41:38,914 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:38,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:38,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:38,915 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:38,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:39,107 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-24 16:41:39,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:39,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:41:39,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:39,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:41:39,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:41:39,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:41:39,108 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 16:41:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:39,292 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-24 16:41:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:41:39,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 16:41:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:39,295 INFO L225 Difference]: With dead ends: 77 [2018-01-24 16:41:39,295 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 16:41:39,296 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-24 16:41:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 16:41:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-24 16:41:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:41:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 16:41:39,307 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 16:41:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:39,307 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 16:41:39,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:41:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 16:41:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:41:39,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:39,308 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-24 16:41:39,308 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-24 16:41:39,309 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:39,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:39,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:39,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:39,310 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:39,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:39,501 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-24 16:41:39,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:39,502 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:39,503 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 16:41:39,504 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-24 16:41:39,546 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:39,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:39,807 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:39,808 INFO L268 AbstractInterpreter]: Visited 22 different actions 33 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 16:41:39,837 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:39,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:39,838 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:39,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:39,849 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:39,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:39,931 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-24 16:41:39,933 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-24 16:41:39,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:39,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:39,941 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-24 16:41:39,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:41:40,070 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-24 16:41:40,080 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-24 16:41:40,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:40,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:40,099 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-24 16:41:40,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 16:41:40,152 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-24 16:41:40,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:40,363 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-24 16:41:40,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,371 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 15 treesize of output 13 [2018-01-24 16:41:40,379 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 7 treesize of output 3 [2018-01-24 16:41:40,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,386 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-24 16:41:40,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 16:41:40,393 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-24 16:41:40,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:40,414 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) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:40,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:40,418 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:40,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:40,478 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-24 16:41:40,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:41:40,534 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-24 16:41:40,537 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-24 16:41:40,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:41:40,684 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-24 16:41:40,689 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-24 16:41:40,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:40,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:40,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:40,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 16:41:40,783 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-24 16:41:40,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:40,874 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 16:41:40,881 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 16:41:40,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:40,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:41:40,951 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-24 16:41:40,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:40,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-24 16:41:40,953 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:40,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:41:40,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:41:40,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 16:41:40,954 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-24 16:41:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:41,530 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 16:41:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:41:41,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 16:41:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:41,533 INFO L225 Difference]: With dead ends: 61 [2018-01-24 16:41:41,533 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 16:41:41,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 16:41:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 16:41:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 16:41:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:41:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 16:41:41,543 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-24 16:41:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:41,543 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 16:41:41,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:41:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 16:41:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:41:41,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:41,545 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-24 16:41:41,545 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:41,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-24 16:41:41,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:41,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:41,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:41,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:41,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:41,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:41,840 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-24 16:41:41,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:41,841 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:41,841 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 16:41:41,841 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-24 16:41:41,842 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:41,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:41,982 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:41,982 INFO L268 AbstractInterpreter]: Visited 22 different actions 33 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 16:41:41,987 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:41,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:41,987 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-24 16:41:42,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:42,002 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:42,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:42,056 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-24 16:41:42,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,131 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-24 16:41:42,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:41:42,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:42,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:41:42,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:42,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:42,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:41:42,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:42,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 16:41:42,825 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-24 16:41:42,825 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:43,156 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 6 treesize of output 1 [2018-01-24 16:41:43,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:41:43,167 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 12 treesize of output 3 [2018-01-24 16:41:43,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,169 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:43,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:41:43,208 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-24 16:41:43,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:43,228 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:43,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:43,232 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:43,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:43,276 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-24 16:41:43,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,285 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-24 16:41:43,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 16:41:43,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:43,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:43,311 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 11 treesize of output 4 [2018-01-24 16:41:43,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:41:43,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 16:41:43,523 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-24 16:41:43,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:43,707 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 6 treesize of output 1 [2018-01-24 16:41:43,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 16:41:43,752 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:43,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,753 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 12 treesize of output 3 [2018-01-24 16:41:43,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:43,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:41:43,766 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-24 16:41:43,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:43,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13, 12, 12] total 46 [2018-01-24 16:41:43,768 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:43,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 16:41:43,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 16:41:43,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 16:41:43,769 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2018-01-24 16:41:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:44,522 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 16:41:44,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:41:44,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-24 16:41:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:44,523 INFO L225 Difference]: With dead ends: 62 [2018-01-24 16:41:44,523 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 16:41:44,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=402, Invalid=3258, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 16:41:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 16:41:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-24 16:41:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 16:41:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 16:41:44,535 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-24 16:41:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:44,535 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 16:41:44,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 16:41:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 16:41:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:41:44,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:44,536 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:44,536 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-01-24 16:41:44,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:44,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:44,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:44,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:44,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:44,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:44,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:44,864 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:44,864 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:44,864 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:41:44,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:44,864 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:44,869 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:44,870 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:44,883 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:44,890 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:44,893 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:44,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:44,902 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-24 16:41:44,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:41:44,910 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-24 16:41:44,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:44,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:44,921 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 11 treesize of output 4 [2018-01-24 16:41:44,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:41:44,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:41:44,960 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-24 16:41:44,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:44,966 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-24 16:41:44,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 16:41:45,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 16:41:45,099 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 16:41:45,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:45,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 16:41:45,212 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 22 treesize of output 18 [2018-01-24 16:41:45,218 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 18 treesize of output 15 [2018-01-24 16:41:45,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:45,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:45,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:45,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 16:41:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:45,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:45,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:41:45,777 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 12 treesize of output 11 [2018-01-24 16:41:45,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,791 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-24 16:41:45,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:41:45,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,798 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 18 [2018-01-24 16:41:45,800 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 9 treesize of output 1 [2018-01-24 16:41:45,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:45,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:45,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:41:45,835 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 16:41:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:46,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:46,001 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:46,008 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:46,009 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:46,023 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:46,043 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:46,079 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:46,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:46,101 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-24 16:41:46,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 16:41:46,118 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-24 16:41:46,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:46,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:46,126 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 11 treesize of output 4 [2018-01-24 16:41:46,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 16:41:46,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:41:46,170 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 12 treesize of output 11 [2018-01-24 16:41:46,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:41:46,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-24 16:41:46,339 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 16:41:46,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:46,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 16:41:46,418 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 21 treesize of output 17 [2018-01-24 16:41:46,424 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 17 treesize of output 14 [2018-01-24 16:41:46,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:46,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:46,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:46,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:41:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:46,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:56,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:41:56,832 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 12 treesize of output 11 [2018-01-24 16:41:56,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:56,844 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-24 16:41:56,846 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:41:56,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:56,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:56,849 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 18 [2018-01-24 16:41:56,851 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 9 treesize of output 1 [2018-01-24 16:41:56,852 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:56,854 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:56,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:56,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:56,880 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:41:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:57,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:57,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 54 [2018-01-24 16:41:57,068 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:57,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 16:41:57,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 16:41:57,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2763, Unknown=5, NotChecked=0, Total=2970 [2018-01-24 16:41:57,070 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2018-01-24 16:41:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:58,125 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 16:41:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:41:58,125 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-01-24 16:41:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:58,126 INFO L225 Difference]: With dead ends: 61 [2018-01-24 16:41:58,126 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 16:41:58,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=484, Invalid=4481, Unknown=5, NotChecked=0, Total=4970 [2018-01-24 16:41:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 16:41:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-24 16:41:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:41:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-24 16:41:58,136 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2018-01-24 16:41:58,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:58,136 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-24 16:41:58,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 16:41:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-24 16:41:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:41:58,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:58,138 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:58,138 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 16:41:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-01-24 16:41:58,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:58,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:58,139 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:41:58,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:58,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:58,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:58,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:58,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:41:58,265 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:58,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:41:58,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:41:58,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:58,266 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-01-24 16:41:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:58,347 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-24 16:41:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:41:58,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 16:41:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:58,348 INFO L225 Difference]: With dead ends: 47 [2018-01-24 16:41:58,348 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:41:58,349 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:41:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:41:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:41:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:41:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:41:58,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-24 16:41:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:58,350 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:41:58,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:41:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:41:58,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:41:58,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:41:58,677 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 79 DAG size of output 52 [2018-01-24 16:41:59,025 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 130 DAG size of output 90 [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,114 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 16:41:59,115 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,115 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 16:41:59,115 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 16:41:59,115 INFO L397 ceAbstractionStarter]: At program point L544'''''(lines 544 545) the Hoare annotation is: (let ((.cse18 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse8 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse9 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse10 (not (= |cstrcpy_#in~s1.offset| 0))) (.cse3 (= 0 cstrcpy_~src~2.offset)) (.cse14 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse15 (< (select |#length| |cstrcpy_#in~s1.base|) .cse18)) (.cse16 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse17 (< .cse18 1))) (and (let ((.cse5 (select |#length| cstrcpy_~src~2.base)) (.cse13 (select |#length| cstrcpy_~dst~2.base))) (let ((.cse1 (not (= cstrcpy_~src~2.base cstrcpy_~dst~2.base))) (.cse11 (<= 1 cstrcpy_~dst~2.offset)) (.cse2 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse4 (<= .cse5 .cse13)) (.cse12 (<= (+ cstrcpy_~src~2.offset 1) .cse5)) (.cse6 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse7 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| cstrcpy_~src~2.base) (+ main_~nondetString~3.offset (select |#length| cstrcpy_~src~2.base) (- 1))) 0) (<= main_~nondetString~3.offset 0))))) (or .cse0 (and .cse1 (= 0 cstrcpy_~dst~2.offset) .cse2 .cse3 .cse4 (<= 1 .cse5) (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse6 .cse7) .cse8 .cse9 .cse10 (and .cse1 .cse11 .cse2 (<= 2 cstrcpy_~src~2.offset) .cse12 .cse6 .cse7 (<= (+ cstrcpy_~dst~2.offset .cse5) (+ cstrcpy_~src~2.offset .cse13))) .cse14 .cse15 .cse16 (and .cse1 .cse11 .cse2 (<= cstrcpy_~dst~2.offset 1) .cse4 .cse12 .cse6 .cse7 (<= 1 cstrcpy_~src~2.offset)) .cse17))) (or .cse0 .cse8 .cse9 .cse10 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) (and (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~src~2.base) cstrcpy_~src~2.offset)) .cse3) .cse14 .cse15 .cse16 .cse17)))) [2018-01-24 16:41:59,115 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 16:41:59,116 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 547) the Hoare annotation is: (let ((.cse8 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse1 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse2 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse3 (not (= |cstrcpy_#in~s1.offset| 0))) (.cse4 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse5 (< (select |#length| |cstrcpy_#in~s1.base|) .cse8)) (.cse6 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse7 (< .cse8 1))) (and (or .cse0 .cse1 .cse2 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) .cse3 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7)))) [2018-01-24 16:41:59,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,116 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:41:59,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,116 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-24 16:41:59,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,116 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-24 16:41:59,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 16:41:59,117 INFO L401 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L397 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 main_~nondetArea~3.offset) (= 0 |main_#t~malloc6.offset|) (not (= main_~nondetArea~3.base main_~nondetString~3.base)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~3 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~3.base |main_#t~malloc7.base|)) (= 1 (select |#valid| main_~nondetArea~3.base)) (<= main_~length2~3 main_~length1~3) (= 0 |main_#t~malloc7.offset|) (= main_~length2~3 (select |#length| |main_#t~malloc7.base|)) (= main_~length2~3 .cse0) (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ (select |#length| main_~nondetString~3.base) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= 0 main_~nondetString~3.offset) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (<= 1 main_~length2~3) (= (select |#valid| |main_#t~malloc6.base|) 1) (<= .cse0 (select |#length| main_~nondetArea~3.base)))) [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 16:41:59,118 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-24 16:41:59,119 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:41:59,119 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 16:41:59,119 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 16:41:59,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,133 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,155 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,156 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,157 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:41:59 BoogieIcfgContainer [2018-01-24 16:41:59,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:41:59,166 INFO L168 Benchmark]: Toolchain (without parser) took 22600.95 ms. Allocated memory was 299.4 MB in the beginning and 592.4 MB in the end (delta: 293.1 MB). Free memory was 259.4 MB in the beginning and 411.0 MB in the end (delta: -151.6 MB). Peak memory consumption was 141.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:59,167 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:41:59,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.48 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:59,167 INFO L168 Benchmark]: Boogie Preprocessor took 27.37 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:59,168 INFO L168 Benchmark]: RCFGBuilder took 238.90 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 230.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:59,168 INFO L168 Benchmark]: TraceAbstraction took 22134.00 ms. Allocated memory was 299.4 MB in the beginning and 592.4 MB in the end (delta: 293.1 MB). Free memory was 229.8 MB in the beginning and 411.0 MB in the end (delta: -181.2 MB). Peak memory consumption was 111.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:59,170 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.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 192.48 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.37 ms. Allocated memory is still 299.4 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.90 ms. Allocated memory is still 299.4 MB. Free memory was 246.4 MB in the beginning and 230.8 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22134.00 ms. Allocated memory was 299.4 MB in the beginning and 592.4 MB in the end (delta: 293.1 MB). Free memory was 229.8 MB in the beginning and 411.0 MB in the end (delta: -181.2 MB). Peak memory consumption was 111.9 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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 220 LocStat_NO_SUPPORTING_DISEQUALITIES : 34 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.872802 RENAME_VARIABLES(MILLISECONDS) : 0.451673 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.816200 PROJECTAWAY(MILLISECONDS) : 0.394244 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000983 DISJOIN(MILLISECONDS) : 0.548719 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.603417 ADD_EQUALITY(MILLISECONDS) : 0.039153 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.022630 #CONJOIN_DISJUNCTIVE : 60 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 222 LocStat_NO_SUPPORTING_DISEQUALITIES : 34 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.769011 RENAME_VARIABLES(MILLISECONDS) : 0.190443 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.359266 PROJECTAWAY(MILLISECONDS) : 0.034244 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001236 DISJOIN(MILLISECONDS) : 0.280460 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.212504 ADD_EQUALITY(MILLISECONDS) : 0.024636 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.042534 #CONJOIN_DISJUNCTIVE : 60 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 16:41:59,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,184 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,184 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,184 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,184 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,193 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,194 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,195 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 16:41:59,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:41:59,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:41:59,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(\valid[s1] == 1) || ((((((((!(src == dst) && 0 == dst) && 1 == \valid[src]) && 0 == src) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && 1 <= unknown-#length-unknown[src]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[s2][main_~nondetString~3.offset + unknown-#length-unknown[s2] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0))) || s1 == s2) || !(1 == \valid[s2])) || !(s1 == 0)) || (((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && 2 <= src) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && dst + unknown-#length-unknown[src] <= src + unknown-#length-unknown[dst])) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || ((((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && dst <= 1) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 <= src)) || unknown-#length-unknown[s2] < 1) && (((((((((!(\valid[s1] == 1) || s1 == s2) || !(1 == \valid[s2])) || !(s1 == 0)) || !(\old(unknown-#memory_int-unknown)[s2][s2] == 0)) || ((0 == unknown-#memory_int-unknown[s2][s2] && 0 == unknown-#memory_int-unknown[src][src]) && 0 == src)) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || unknown-#length-unknown[s2] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 22.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 464 SDslu, 1736 SDs, 0 SdLazy, 1553 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 213 SyntacticMatches, 15 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 16.6s 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, 0.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 604 HoareAnnotationTreeSize, 9 FomulaSimplifications, 182 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 742 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 545 ConstructedInterpolants, 43 QuantifiedInterpolants, 140775 SizeOfPredicates, 117 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 3/93 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-41-59-207.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-41-59-207.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-41-59-207.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-41-59-207.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-41-59-207.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-41-59-207.csv Received shutdown request...