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_RubberTaipan+AI_EQ.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 12:46:04,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:46:04,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:46:04,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:46:04,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:46:04,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:46:04,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:46:04,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:46:04,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:46:04,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:46:04,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:46:04,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:46:04,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:46:04,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:46:04,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:46:04,241 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:46:04,243 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:46:04,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:46:04,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:46:04,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:46:04,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:46:04,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:46:04,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:46:04,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:46:04,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:46:04,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:46:04,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:46:04,254 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:46:04,255 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:46:04,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:46:04,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:46:04,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:46:04,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:46:04,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:46:04,265 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:46:04,265 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:46:04,265 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:46:04,265 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:46:04,265 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:46:04,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:46:04,266 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:46:04,267 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:46:04,267 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:46:04,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:46:04,267 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:46:04,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:46:04,267 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:46:04,268 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:46:04,268 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:46:04,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:46:04,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:46:04,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:46:04,269 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:46:04,270 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:46:04,270 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:46:04,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:46:04,314 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:46:04,318 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:46:04,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:46:04,319 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:46:04,320 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 12:46:04,492 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:46:04,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:46:04,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:04,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:46:04,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:46:04,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04, skipping insertion in model container [2018-01-24 12:46:04,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,521 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:04,560 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:04,681 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:04,699 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:04,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04 WrapperNode [2018-01-24 12:46:04,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:04,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:46:04,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:46:04,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:46:04,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (1/1) ... [2018-01-24 12:46:04,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:46:04,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:46:04,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:46:04,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:46:04,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (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 12:46:04,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:46:04,778 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:46:04,779 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 12:46:04,779 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 12:46:04,779 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:46:04,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:46:04,780 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:46:04,958 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:46:04,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:04 BoogieIcfgContainer [2018-01-24 12:46:04,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:46:04,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:46:04,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:46:04,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:46:04,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:46:04" (1/3) ... [2018-01-24 12:46:04,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ef7197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:04, skipping insertion in model container [2018-01-24 12:46:04,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:04" (2/3) ... [2018-01-24 12:46:04,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ef7197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:04, skipping insertion in model container [2018-01-24 12:46:04,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:04" (3/3) ... [2018-01-24 12:46:04,964 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:46:04,970 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:46:04,975 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 12:46:05,011 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:46:05,011 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:46:05,011 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:46:05,012 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:46:05,012 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:46:05,012 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:46:05,012 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:46:05,012 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:46:05,013 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:46:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 12:46:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:46:05,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:05,033 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:05,033 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 12:46:05,041 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:05,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:05,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:05,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:05,195 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 12:46:05,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:05,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:05,197 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:05,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:05,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:05,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:05,212 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 12:46:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:05,303 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 12:46:05,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:46:05,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:46:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:05,312 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:46:05,312 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:46:05,315 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 12:46:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:46:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 12:46:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:46:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 12:46:05,413 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 12:46:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:05,414 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 12:46:05,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 12:46:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:46:05,414 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:05,414 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:05,414 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 12:46:05,415 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:05,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:05,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:05,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:05,467 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 12:46:05,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:05,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:46:05,468 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:05,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:46:05,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:46:05,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:46:05,470 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 12:46:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:05,547 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 12:46:05,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:46:05,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 12:46:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:05,549 INFO L225 Difference]: With dead ends: 40 [2018-01-24 12:46:05,549 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:46:05,550 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 12:46:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:46:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 12:46:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:46:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 12:46:05,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 12:46:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:05,557 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 12:46:05,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:46:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 12:46:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:05,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:05,558 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:05,558 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:05,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 12:46:05,558 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:05,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:05,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:05,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:05,638 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 12:46:05,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:05,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:05,661 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:05,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:05,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:05,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:05,662 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 12:46:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:05,729 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 12:46:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:46:05,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:46:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:05,731 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:46:05,731 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:46:05,731 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 12:46:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:46:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:46:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:46:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:46:05,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 12:46:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:05,738 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:46:05,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:46:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:05,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:05,739 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:05,739 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 12:46:05,739 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:05,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:05,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:05,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:05,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:05,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:05,835 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:05,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:46:05,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:46:05,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:46:05,836 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 12:46:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:05,884 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:46:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:05,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:46:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:05,885 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:46:05,885 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:46:05,886 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:46:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:46:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:46:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:46:05,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 12:46:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:05,890 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:46:05,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:46:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:46:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:46:05,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:05,890 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 12:46:05,891 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-24 12:46:05,891 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:05,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:05,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:05,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:05,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:05,938 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 12:46:05,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:05,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:46:05,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:05,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:46:05,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:46:05,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:05,940 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 12:46:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:06,066 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 12:46:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:06,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:46:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:06,067 INFO L225 Difference]: With dead ends: 35 [2018-01-24 12:46:06,068 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 12:46:06,068 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 12:46:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 12:46:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 12:46:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:46:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 12:46:06,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-24 12:46:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:06,073 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 12:46:06,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:46:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 12:46:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:46:06,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:06,074 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 12:46:06,075 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-24 12:46:06,075 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:06,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:06,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,076 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:06,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:06,190 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 12:46:06,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:06,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:46:06,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:06,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:46:06,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:46:06,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:46:06,192 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-24 12:46:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:06,336 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 12:46:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:46:06,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:46:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:06,337 INFO L225 Difference]: With dead ends: 42 [2018-01-24 12:46:06,337 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:46:06,338 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 12:46:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:46:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-24 12:46:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:46:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 12:46:06,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-24 12:46:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:06,344 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 12:46:06,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:46:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 12:46:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:46:06,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:06,345 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 12:46:06,345 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-24 12:46:06,346 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:06,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:06,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:06,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:06,450 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 12:46:06,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:06,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:46:06,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:06,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:46:06,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:46:06,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:46:06,452 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-24 12:46:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:06,542 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 12:46:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:46:06,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 12:46:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:06,543 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:46:06,543 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:46:06,543 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 12:46:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:46:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:46:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:46:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:46:06,547 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-24 12:46:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:06,547 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:46:06,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:46:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:46:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:46:06,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:06,548 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 12:46:06,548 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:06,549 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-24 12:46:06,549 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:06,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:06,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:06,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:06,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 12:46:06,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:06,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:46:06,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:06,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:46:06,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:46:06,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:46:06,684 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-24 12:46:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:06,819 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 12:46:06,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:46:06,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 12:46:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:06,821 INFO L225 Difference]: With dead ends: 39 [2018-01-24 12:46:06,821 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:46:06,821 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 12:46:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:46:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 12:46:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:46:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 12:46:06,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-24 12:46:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:06,828 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 12:46:06,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:46:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 12:46:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:46:06,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:06,829 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 12:46:06,829 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:06,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-24 12:46:06,830 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:06,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:06,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:06,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:06,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:07,041 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 12:46:07,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:07,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:46:07,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:07,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:46:07,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:46:07,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:46:07,042 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 12:46:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:07,216 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-24 12:46:07,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:46:07,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 12:46:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:07,218 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:46:07,218 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:46:07,219 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 12:46:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:46:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-24 12:46:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:46:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 12:46:07,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 12:46:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:07,228 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 12:46:07,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:46:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 12:46:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:46:07,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:07,229 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 12:46:07,230 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-24 12:46:07,230 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:07,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:07,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:07,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:07,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:07,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:07,394 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 12:46:07,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:07,394 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 12:46:07,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:07,401 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:07,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:07,469 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 12:46:07,472 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 12:46:07,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,484 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 12:46:07,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:07,632 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 12:46:07,639 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 12:46:07,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:07,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:07,653 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 12:46:07,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 12:46:07,694 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 12:46:07,694 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:07,869 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 12:46:07,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,877 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 12:46:07,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:46:07,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,899 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 12:46:07,899 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:46:07,905 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 12:46:07,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:07,926 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 12:46:07,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:07,930 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:07,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:07,984 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 12:46:07,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:07,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:46:08,041 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 12:46:08,043 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 12:46:08,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:08,187 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 12:46:08,194 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 12:46:08,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:08,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:08,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:08,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 12:46:08,298 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 12:46:08,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:08,386 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 12:46:08,393 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 12:46:08,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:08,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:46:08,454 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 12:46:08,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:08,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-24 12:46:08,456 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:08,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:46:08,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:46:08,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:46:08,457 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-24 12:46:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:08,942 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 12:46:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:46:08,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 12:46:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:08,945 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:46:08,945 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:46:08,946 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 12:46:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:46:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 12:46:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:46:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 12:46:08,955 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-24 12:46:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:08,956 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 12:46:08,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:46:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 12:46:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:46:08,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:08,957 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 12:46:08,957 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-24 12:46:08,957 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:08,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:08,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:08,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:08,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:08,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:09,200 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 12:46:09,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:09,200 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 12:46:09,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:09,205 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:09,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:09,230 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 12:46:09,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,235 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 12:46:09,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,239 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 12:46:09,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:46:09,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:09,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:09,273 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 12:46:09,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,279 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 12:46:09,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,284 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 12:46:09,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 12:46:09,596 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 12:46:09,597 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:09,957 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 12:46:09,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,961 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 12:46:09,969 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:46:09,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 12:46:09,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:09,977 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 12:46:09,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:46:10,004 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 12:46:10,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:10,024 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 12:46:10,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:10,027 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:10,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:10,088 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 12:46:10,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,095 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 12:46:10,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,101 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 12:46:10,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:46:10,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:10,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:10,116 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 12:46:10,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,130 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 12:46:10,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,138 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 12:46:10,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 12:46:10,323 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 12:46:10,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:10,505 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 12:46:10,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,510 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 12:46:10,519 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:46:10,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,521 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 12:46:10,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:10,530 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 12:46:10,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:46:10,535 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 12:46:10,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:10,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13, 12, 12] total 46 [2018-01-24 12:46:10,537 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:10,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 12:46:10,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 12:46:10,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:46:10,538 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2018-01-24 12:46:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:11,380 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 12:46:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:46:11,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-24 12:46:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:11,427 INFO L225 Difference]: With dead ends: 62 [2018-01-24 12:46:11,427 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:46:11,429 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=402, Invalid=3258, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 12:46:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:46:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-24 12:46:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:46:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 12:46:11,435 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-24 12:46:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:11,435 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 12:46:11,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 12:46:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 12:46:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:46:11,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:11,436 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 12:46:11,436 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:11,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-01-24 12:46:11,436 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:11,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:11,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:11,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:11,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:11,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:11,826 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 12:46:11,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:11,826 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 12:46:11,836 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:11,836 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:11,852 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:11,858 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:11,860 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:11,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:11,866 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 12:46:11,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:46:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:11,895 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 12:46:11,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-01-24 12:46:11,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:46:11,950 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 12:46:11,952 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 12:46:11,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:11,987 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 12:46:11,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 12:46:12,113 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 12:46:12,115 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 12:46:12,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,131 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 12:46:12,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 12:46:12,208 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 12:46:12,214 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 12:46:12,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:12,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:12,227 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 12:46:12,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 12:46:12,284 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 12:46:12,284 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:12,736 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 12:46:12,749 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 12:46:12,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,761 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 12:46:12,763 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 12:46:12,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,767 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 12:46:12,769 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 12:46:12,769 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:12,781 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 12:46:12,801 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 12:46:12,802 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 12:46:12,952 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 12:46:12,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:12,972 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 12:46:12,977 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:12,977 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:12,993 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:13,012 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:13,047 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:13,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:13,058 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 12:46:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:46:13,065 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 12:46:13,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:13,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:13,072 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 12:46:13,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:46:13,115 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 12:46:13,117 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 12:46:13,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 12:46:13,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 12:46:13,340 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 12:46:13,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,348 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 12:46:13,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 12:46:13,421 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 12:46:13,425 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 12:46:13,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:13,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:13,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:13,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 12:46:13,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 12:46:13,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:13,591 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 12:46:13,608 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 12:46:13,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,622 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 12:46:13,624 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 12:46:13,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,627 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 12:46:13,630 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 12:46:13,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:13,644 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 12:46:13,663 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 12:46:13,663 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 12:46:13,834 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 12:46:13,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:13,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 51 [2018-01-24 12:46:13,836 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:13,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 12:46:13,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 12:46:13,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 12:46:13,837 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2018-01-24 12:46:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:14,857 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 12:46:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:46:14,857 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-01-24 12:46:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:14,858 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:46:14,858 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:46:14,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1056 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-01-24 12:46:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:46:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-24 12:46:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:46:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-24 12:46:14,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2018-01-24 12:46:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:14,867 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-24 12:46:14,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 12:46:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-24 12:46:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:46:14,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:14,869 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 12:46:14,869 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:46:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-01-24 12:46:14,869 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:14,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:14,870 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:46:14,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:14,870 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:14,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:14,991 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 12:46:14,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:14,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:46:14,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:14,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:46:14,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:46:14,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:14,992 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-01-24 12:46:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:15,125 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-24 12:46:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:46:15,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 12:46:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:15,126 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:46:15,126 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:46:15,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:46:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:46:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:46:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:46:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:46:15,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-24 12:46:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:15,127 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:46:15,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:46:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:46:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:46:15,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:46:15,839 WARN L146 SmtUtils]: Spent 644ms on a formula simplification. DAG size of input: 79 DAG size of output 52 [2018-01-24 12:46:16,958 WARN L146 SmtUtils]: Spent 1116ms on a formula simplification. DAG size of input: 130 DAG size of output 90 [2018-01-24 12:46:17,094 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 75 DAG size of output 59 [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,096 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 12:46:17,097 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 12:46:17,097 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))) (.cse1 (= 0 cstrcpy_~src~2.offset)) (.cse2 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse4 (not (= |cstrcpy_#in~s1.offset| 0))) (.cse5 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse6 (< (select |#length| |cstrcpy_#in~s1.base|) .cse18)) (.cse7 (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))))) (.cse8 (< .cse18 1))) (and (or .cse0 (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)) .cse1) .cse2 .cse3 .cse4 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse5 .cse6 .cse7 .cse8) (let ((.cse12 (select |#length| cstrcpy_~src~2.base)) (.cse17 (select |#length| cstrcpy_~dst~2.base))) (let ((.cse9 (not (= cstrcpy_~src~2.base cstrcpy_~dst~2.base))) (.cse15 (<= 1 cstrcpy_~dst~2.offset)) (.cse10 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse11 (<= .cse12 .cse17)) (.cse16 (<= (+ cstrcpy_~src~2.offset 1) .cse12)) (.cse13 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse14 (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 .cse9 (= 0 cstrcpy_~dst~2.offset) .cse10 .cse1 .cse11 (<= 1 .cse12) (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))) .cse13 .cse14) .cse2 .cse3 .cse4 (and .cse9 .cse15 .cse10 (<= 2 cstrcpy_~src~2.offset) .cse16 .cse13 .cse14 (<= (+ cstrcpy_~dst~2.offset .cse12) (+ cstrcpy_~src~2.offset .cse17))) .cse5 .cse6 .cse7 (and .cse9 .cse15 .cse10 (<= cstrcpy_~dst~2.offset 1) .cse11 .cse16 .cse13 .cse14 (<= 1 cstrcpy_~src~2.offset)) .cse8)))))) [2018-01-24 12:46:17,097 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 12:46:17,097 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 .cse3 .cse4 .cse5 .cse6 (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))) .cse7) (or (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) .cse0 .cse1 .cse2 .cse3 (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7)))) [2018-01-24 12:46:17,097 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,097 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:46:17,097 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-24 12:46:17,098 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 12:46:17,099 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 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 12:46:17,099 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 12:46:17,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,111 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,111 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,112 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,112 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,112 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,113 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,113 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,113 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,116 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,116 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,118 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,119 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,122 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,123 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,123 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,123 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,135 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,135 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,135 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,135 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,136 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,136 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,136 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,137 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,137 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,137 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,138 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,139 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,145 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:46:17 BoogieIcfgContainer [2018-01-24 12:46:17,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:46:17,148 INFO L168 Benchmark]: Toolchain (without parser) took 12656.35 ms. Allocated memory was 303.6 MB in the beginning and 595.6 MB in the end (delta: 292.0 MB). Free memory was 263.6 MB in the beginning and 454.4 MB in the end (delta: -190.8 MB). Peak memory consumption was 242.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:17,150 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:46:17,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:17,150 INFO L168 Benchmark]: Boogie Preprocessor took 28.97 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:17,150 INFO L168 Benchmark]: RCFGBuilder took 224.18 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 234.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:17,151 INFO L168 Benchmark]: TraceAbstraction took 12188.37 ms. Allocated memory was 303.6 MB in the beginning and 595.6 MB in the end (delta: 292.0 MB). Free memory was 234.9 MB in the beginning and 454.4 MB in the end (delta: -219.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:46:17,152 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.13 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.64 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.97 ms. Allocated memory is still 303.6 MB. Free memory was 252.5 MB in the beginning and 250.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.18 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 234.9 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12188.37 ms. Allocated memory was 303.6 MB in the beginning and 595.6 MB in the end (delta: 292.0 MB). Free memory was 234.9 MB in the beginning and 454.4 MB in the end (delta: -219.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 5.3 GB. * 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 #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 - 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 * 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 12:46:17,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,163 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,175 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,176 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,177 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,178 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,179 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 12:46:17,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,182 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:46:17,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((!(\valid[s1] == 1) || ((0 == unknown-#memory_int-unknown[s2][s2] && 0 == unknown-#memory_int-unknown[src][src]) && 0 == src)) || s1 == s2) || !(1 == \valid[s2])) || !(s1 == 0)) || !(\old(unknown-#memory_int-unknown)[s2][s2] == 0)) || !(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) && ((((((((((!(\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) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 12.0s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 464 SDslu, 1736 SDs, 0 SdLazy, 1553 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 215 SyntacticMatches, 16 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 2245 ImplicationChecksByTransitivity, 6.2s 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.0s AbstIntTime, 0 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, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 545 ConstructedInterpolants, 43 QuantifiedInterpolants, 140035 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-46-17-188.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-46-17-188.csv Received shutdown request...