java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:14:30,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:14:30,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:14:30,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:14:30,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:14:30,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:14:30,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:14:30,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:14:30,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:14:30,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:14:30,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:14:30,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:14:30,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:14:30,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:14:30,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:14:30,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:14:30,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:14:30,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:14:30,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:14:30,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:14:30,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:14:30,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:14:30,643 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:14:30,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:14:30,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:14:30,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:14:30,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:14:30,648 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:14:30,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:14:30,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:14:30,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:14:30,649 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:14:30,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:14:30,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:14:30,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:14:30,661 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:14:30,661 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:14:30,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:14:30,662 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:14:30,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:14:30,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:14:30,663 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:14:30,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:14:30,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:14:30,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:14:30,663 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:14:30,664 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:14:30,664 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:14:30,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:14:30,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:14:30,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:14:30,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:14:30,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:14:30,665 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:14:30,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:14:30,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:14:30,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:14:30,666 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:14:30,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:14:30,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:14:30,667 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:14:30,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:14:30,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:14:30,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:14:30,667 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:14:30,668 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:14:30,668 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:14:30,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:14:30,718 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:14:30,722 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:14:30,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:14:30,724 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:14:30,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:14:30,923 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:14:30,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:14:30,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:14:30,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:14:30,935 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:14:30,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:14:30" (1/1) ... [2018-01-24 15:14:30,938 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 03:14:30, skipping insertion in model container [2018-01-24 15:14:30,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:14:30" (1/1) ... [2018-01-24 15:14:30,952 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:14:30,990 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:14:31,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:14:31,122 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:14:31,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31 WrapperNode [2018-01-24 15:14:31,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:14:31,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:14:31,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:14:31,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:14:31,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... [2018-01-24 15:14:31,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:14:31,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:14:31,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:14:31,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:14:31,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:14:31,216 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:14:31,216 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:14:31,216 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-24 15:14:31,216 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:14:31,217 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:14:31,218 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-24 15:14:31,218 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:14:31,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:14:31,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:14:31,428 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:14:31,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:14:31 BoogieIcfgContainer [2018-01-24 15:14:31,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:14:31,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:14:31,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:14:31,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:14:31,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:14:30" (1/3) ... [2018-01-24 15:14:31,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ff7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:14:31, skipping insertion in model container [2018-01-24 15:14:31,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:14:31" (2/3) ... [2018-01-24 15:14:31,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ff7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:14:31, skipping insertion in model container [2018-01-24 15:14:31,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:14:31" (3/3) ... [2018-01-24 15:14:31,436 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:14:31,445 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:14:31,451 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 15:14:31,498 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:14:31,498 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:14:31,498 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:14:31,498 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:14:31,498 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:14:31,499 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:14:31,499 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:14:31,499 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:14:31,500 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:14:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 15:14:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:14:31,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:31,528 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:31,529 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:31,534 INFO L82 PathProgramCache]: Analyzing trace with hash 118579097, now seen corresponding path program 1 times [2018-01-24 15:14:31,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:31,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:31,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:31,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:31,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:31,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:31,735 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 15:14:31,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:31,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:14:31,737 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:31,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:14:31,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:14:31,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:14:31,753 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-24 15:14:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:31,929 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-24 15:14:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:14:31,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:14:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:31,945 INFO L225 Difference]: With dead ends: 59 [2018-01-24 15:14:31,945 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 15:14:31,949 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 15:14:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 15:14:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 15:14:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 15:14:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 15:14:31,992 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-01-24 15:14:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:31,992 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 15:14:31,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:14:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 15:14:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:14:31,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:31,993 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:31,994 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash 118579098, now seen corresponding path program 1 times [2018-01-24 15:14:31,994 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:31,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:31,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:31,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:31,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:32,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:14:32,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:32,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:14:32,139 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:32,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:14:32,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:14:32,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:14:32,142 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-01-24 15:14:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:32,210 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-01-24 15:14:32,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:14:32,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 15:14:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:32,212 INFO L225 Difference]: With dead ends: 42 [2018-01-24 15:14:32,212 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 15:14:32,213 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 15:14:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 15:14:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 15:14:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:14:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 15:14:32,218 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-01-24 15:14:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:32,219 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 15:14:32,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:14:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 15:14:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:14:32,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:32,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:32,219 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash -539609344, now seen corresponding path program 1 times [2018-01-24 15:14:32,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:32,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:32,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:32,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:32,299 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 15:14:32,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:32,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:32,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:32,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:32,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:32,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:32,301 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-01-24 15:14:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:32,436 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-01-24 15:14:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:14:32,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 15:14:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:32,438 INFO L225 Difference]: With dead ends: 41 [2018-01-24 15:14:32,438 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 15:14:32,439 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 15:14:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 15:14:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 15:14:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 15:14:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-24 15:14:32,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-01-24 15:14:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:32,445 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-24 15:14:32,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-24 15:14:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:14:32,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:32,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:32,447 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash -539609343, now seen corresponding path program 1 times [2018-01-24 15:14:32,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:32,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:32,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:32,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:32,592 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 15:14:32,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:32,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:14:32,593 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:32,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:14:32,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:14:32,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:14:32,593 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-01-24 15:14:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:32,742 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-01-24 15:14:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:14:32,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-24 15:14:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:32,746 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:14:32,746 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:14:32,746 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:14:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-24 15:14:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:14:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:14:32,753 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-01-24 15:14:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:32,754 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:14:32,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:14:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:14:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:14:32,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:32,755 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 15:14:32,755 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 451979505, now seen corresponding path program 1 times [2018-01-24 15:14:32,756 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:32,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:32,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:32,757 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:32,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:32,914 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 15:14:32,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:32,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:14:32,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:32,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:14:32,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:14:32,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:14:32,915 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 9 states. [2018-01-24 15:14:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:33,026 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 15:14:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:14:33,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 15:14:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:33,027 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:14:33,027 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:14:33,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:14:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-01-24 15:14:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:14:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-01-24 15:14:33,032 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-01-24 15:14:33,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:33,032 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-01-24 15:14:33,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:14:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-01-24 15:14:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:14:33,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:33,033 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 15:14:33,033 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 451979504, now seen corresponding path program 1 times [2018-01-24 15:14:33,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:33,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:33,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:33,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:33,156 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 15:14:33,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:33,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:14:33,157 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:33,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:14:33,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:14:33,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:14:33,158 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-01-24 15:14:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:33,265 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-01-24 15:14:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:14:33,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 15:14:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:33,266 INFO L225 Difference]: With dead ends: 44 [2018-01-24 15:14:33,266 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 15:14:33,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 15:14:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 15:14:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:14:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:14:33,272 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-24 15:14:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:33,272 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:14:33,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:14:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:14:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:14:33,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:33,274 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] [2018-01-24 15:14:33,274 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:33,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1872127023, now seen corresponding path program 1 times [2018-01-24 15:14:33,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:33,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:33,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,276 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:33,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:33,354 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 15:14:33,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:33,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:14:33,354 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:33,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:33,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:33,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:33,355 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-01-24 15:14:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:33,416 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-24 15:14:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:14:33,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 15:14:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:33,421 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:14:33,421 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 15:14:33,422 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:14:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 15:14:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-01-24 15:14:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:14:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-01-24 15:14:33,430 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-01-24 15:14:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:33,431 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-01-24 15:14:33,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-01-24 15:14:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:14:33,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:33,432 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] [2018-01-24 15:14:33,432 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:33,433 INFO L82 PathProgramCache]: Analyzing trace with hash 851058669, now seen corresponding path program 1 times [2018-01-24 15:14:33,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:33,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:33,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:33,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:33,637 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 15:14:33,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:33,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:14:33,637 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:33,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:14:33,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:14:33,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:14:33,639 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-01-24 15:14:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:33,806 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-01-24 15:14:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:14:33,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 15:14:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:33,808 INFO L225 Difference]: With dead ends: 150 [2018-01-24 15:14:33,808 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 15:14:33,808 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 15:14:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 15:14:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-01-24 15:14:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 15:14:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-01-24 15:14:33,818 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-01-24 15:14:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:33,819 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-01-24 15:14:33,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:14:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-01-24 15:14:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:14:33,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:33,820 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] [2018-01-24 15:14:33,820 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash -737289233, now seen corresponding path program 1 times [2018-01-24 15:14:33,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:33,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:33,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:33,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:33,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:33,993 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 15:14:33,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:33,994 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:33,995 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 15:14:33,996 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [13], [14], [39], [45], [46], [50], [55], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-24 15:14:34,049 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:14:34,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:14:37,665 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:14:37,667 INFO L268 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-24 15:14:37,705 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:14:37,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:37,705 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 15:14:37,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:37,725 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:37,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:37,796 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 15:14:37,798 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 15:14:37,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:37,811 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 15:14:37,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:14:37,962 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 15:14:37,997 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 15:14:37,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,029 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 15:14:38,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 15:14:38,065 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 15:14:38,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:38,259 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 15:14:38,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 15:14:38,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 15:14:38,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,286 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 15:14:38,286 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 15:14:38,293 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 15:14:38,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:38,323 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 15:14:38,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:38,326 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:38,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:38,401 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 15:14:38,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:14:38,547 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 15:14:38,554 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 15:14:38,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:38,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:14:38,710 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 15:14:38,720 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 15:14:38,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:38,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 15:14:38,990 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 15:14:38,990 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:39,093 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 15:14:39,101 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 15:14:39,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:39,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:39,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:39,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:14:39,174 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 15:14:39,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:39,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-24 15:14:39,175 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:39,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 15:14:39,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 15:14:39,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 15:14:39,176 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 17 states. [2018-01-24 15:14:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:41,782 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-01-24 15:14:41,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:14:41,782 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-24 15:14:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:41,784 INFO L225 Difference]: With dead ends: 116 [2018-01-24 15:14:41,784 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 15:14:41,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=1932, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 15:14:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 15:14:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-01-24 15:14:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 15:14:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-01-24 15:14:41,800 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-01-24 15:14:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:41,800 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-01-24 15:14:41,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 15:14:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-01-24 15:14:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:14:41,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:41,802 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] [2018-01-24 15:14:41,802 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493848, now seen corresponding path program 1 times [2018-01-24 15:14:41,802 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:41,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:41,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:41,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:41,870 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 15:14:41,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:41,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:41,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:41,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:41,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:41,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:41,872 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-01-24 15:14:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:41,935 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-01-24 15:14:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:14:41,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 15:14:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:41,936 INFO L225 Difference]: With dead ends: 105 [2018-01-24 15:14:41,936 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 15:14:41,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:14:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 15:14:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-01-24 15:14:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 15:14:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-01-24 15:14:41,949 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-01-24 15:14:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:41,949 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-01-24 15:14:41,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-01-24 15:14:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:14:41,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:41,951 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] [2018-01-24 15:14:41,951 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493847, now seen corresponding path program 1 times [2018-01-24 15:14:41,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:41,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:41,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:41,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:41,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:42,125 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 15:14:42,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:42,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:14:42,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:42,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:14:42,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:14:42,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:14:42,127 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-01-24 15:14:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:42,258 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-01-24 15:14:42,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:14:42,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-24 15:14:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:42,260 INFO L225 Difference]: With dead ends: 136 [2018-01-24 15:14:42,260 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 15:14:42,260 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 15:14:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-01-24 15:14:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 15:14:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-24 15:14:42,284 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-01-24 15:14:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:42,284 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-24 15:14:42,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:14:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-24 15:14:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:14:42,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:42,287 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] [2018-01-24 15:14:42,287 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash 595125547, now seen corresponding path program 1 times [2018-01-24 15:14:42,288 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:42,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:42,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:42,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:42,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:42,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:42,578 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 15:14:42,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:42,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 15:14:42,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:42,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:14:42,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:14:42,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:14:42,580 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 12 states. [2018-01-24 15:14:43,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:43,072 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2018-01-24 15:14:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:14:43,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-01-24 15:14:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:43,074 INFO L225 Difference]: With dead ends: 122 [2018-01-24 15:14:43,074 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 15:14:43,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:14:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 15:14:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-01-24 15:14:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 15:14:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-01-24 15:14:43,086 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-01-24 15:14:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:43,086 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-01-24 15:14:43,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:14:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-01-24 15:14:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:14:43,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:43,088 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] [2018-01-24 15:14:43,088 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1381129789, now seen corresponding path program 1 times [2018-01-24 15:14:43,088 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:43,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:43,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:43,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:43,090 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:43,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:43,188 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 15:14:43,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:43,189 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:43,189 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:14:43,189 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [14], [16], [39], [45], [46], [50], [55], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-24 15:14:43,191 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:14:43,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:14:46,053 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:14:46,053 INFO L268 AbstractInterpreter]: Visited 21 different actions 39 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-24 15:14:46,060 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:14:46,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:46,060 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 15:14:46,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:46,080 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:46,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:46,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:14:46,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,174 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 15:14:46,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:46,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:46,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:46,213 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 15:14:46,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,219 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 15:14:46,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,224 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 15:14:46,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:14:46,313 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 15:14:46,314 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:46,474 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 15:14:46,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:46,495 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 15:14:46,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:46,498 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:46,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:46,539 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 15:14:46,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,550 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 15:14:46,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:46,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:46,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:46,572 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 15:14:46,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,580 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 15:14:46,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,586 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 15:14:46,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:14:46,697 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 15:14:46,698 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:46,744 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:46,744 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:24, output treesize:1 [2018-01-24 15:14:46,748 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 15:14:46,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:46,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 10, 9] total 31 [2018-01-24 15:14:46,751 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:46,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:14:46,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:14:46,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2018-01-24 15:14:46,752 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 19 states. [2018-01-24 15:14:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:47,138 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-01-24 15:14:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:14:47,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-24 15:14:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:47,140 INFO L225 Difference]: With dead ends: 134 [2018-01-24 15:14:47,140 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 15:14:47,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 15:14:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 15:14:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-01-24 15:14:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 15:14:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-24 15:14:47,153 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2018-01-24 15:14:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:47,154 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-24 15:14:47,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 15:14:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-24 15:14:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:14:47,155 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:47,155 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] [2018-01-24 15:14:47,155 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2091617170, now seen corresponding path program 1 times [2018-01-24 15:14:47,155 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:47,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:47,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:47,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:47,157 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:47,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:47,202 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 15:14:47,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:47,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:47,202 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:47,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:14:47,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:14:47,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:14:47,203 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 5 states. [2018-01-24 15:14:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:47,243 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-01-24 15:14:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:14:47,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 15:14:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:47,244 INFO L225 Difference]: With dead ends: 125 [2018-01-24 15:14:47,244 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 15:14:47,245 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 15:14:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 15:14:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 15:14:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-24 15:14:47,257 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-01-24 15:14:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:47,257 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-24 15:14:47,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:14:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-24 15:14:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:14:47,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:47,258 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] [2018-01-24 15:14:47,258 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -156851199, now seen corresponding path program 2 times [2018-01-24 15:14:47,259 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:47,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:47,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:47,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:47,260 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:47,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:47,838 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 15:14:47,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:47,838 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:47,838 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:14:47,839 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:14:47,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:47,839 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 15:14:47,844 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:47,844 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:47,858 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:47,864 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:47,866 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:47,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:47,872 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 15:14:47,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:14:47,880 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 15:14:47,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:47,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:47,888 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 15:14:47,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:14:47,925 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 15:14:47,927 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 15:14:47,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:47,934 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 15:14:47,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 15:14:48,106 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 15:14:48,108 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 15:14:48,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,118 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 15:14:48,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 15:14:48,178 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 15:14:48,183 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 15:14:48,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:48,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:48,194 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 15:14:48,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 15:14:48,241 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 15:14:48,241 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:48,749 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 15:14:48,761 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 15:14:48,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,773 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 15:14:48,775 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 15:14:48,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,779 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 15:14:48,780 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 15:14:48,780 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:48,791 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 15:14:48,812 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 15:14:48,812 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 15:14:48,977 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 15:14:48,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:48,997 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 15:14:49,000 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:14:49,000 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:14:49,015 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:49,037 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:14:49,073 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:14:49,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:49,081 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 15:14:49,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:14:49,085 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 15:14:49,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:49,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:49,091 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 15:14:49,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:14:49,130 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 15:14:49,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:14:49,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 15:14:49,310 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 15:14:49,312 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 15:14:49,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,320 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 15:14:49,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 15:14:49,392 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 15:14:49,396 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 15:14:49,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:14:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:49,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:14:49,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 15:14:49,438 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 15:14:49,438 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:49,589 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 15:14:49,601 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 15:14:49,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,612 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 15:14:49,614 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 15:14:49,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,618 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 15:14:49,620 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 15:14:49,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:49,633 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 15:14:49,661 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 15:14:49,661 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 15:14:49,835 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 15:14:49,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:49,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 51 [2018-01-24 15:14:49,836 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:49,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 15:14:49,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 15:14:49,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 15:14:49,837 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 26 states. [2018-01-24 15:14:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:50,998 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-01-24 15:14:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:14:50,998 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-01-24 15:14:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:50,999 INFO L225 Difference]: With dead ends: 130 [2018-01-24 15:14:50,999 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 15:14:51,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-01-24 15:14:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 15:14:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2018-01-24 15:14:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 15:14:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-01-24 15:14:51,010 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 28 [2018-01-24 15:14:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:51,011 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-01-24 15:14:51,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 15:14:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-01-24 15:14:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:14:51,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:51,011 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, 1, 1, 1, 1] [2018-01-24 15:14:51,011 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1429135806, now seen corresponding path program 1 times [2018-01-24 15:14:51,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:51,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:51,012 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:14:51,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:51,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:51,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:51,235 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 15:14:51,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:51,235 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:14:51,235 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:14:51,236 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [14], [19], [23], [25], [30], [31], [33], [34], [45], [46], [50], [53], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-24 15:14:51,237 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:14:51,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:14:56,157 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:14:56,157 INFO L268 AbstractInterpreter]: Visited 26 different actions 43 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-01-24 15:14:56,160 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:14:56,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:56,161 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:14:56,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:56,165 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:56,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:56,186 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 15:14:56,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,191 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 15:14:56,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:56,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:56,226 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 15:14:56,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:56,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:56,235 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 15:14:56,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,240 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 15:14:56,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:14:56,459 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 15:14:56,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:56,833 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 15:14:56,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:14:56,866 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:14:56,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:56,885 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:14:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:56,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:14:56,967 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 15:14:56,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,992 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 15:14:56,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:14:56,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:14:57,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:57,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:14:57,006 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 15:14:57,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:57,013 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 15:14:57,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:57,018 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 15:14:57,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:14:57,210 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 15:14:57,210 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:14:57,331 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 15:14:57,331 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:24, output treesize:1 [2018-01-24 15:14:57,335 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 15:14:57,336 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:14:57,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13, 14, 13] total 44 [2018-01-24 15:14:57,336 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:14:57,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 15:14:57,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 15:14:57,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 15:14:57,337 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 28 states. [2018-01-24 15:14:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:58,797 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-01-24 15:14:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-24 15:14:58,798 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-01-24 15:14:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:58,799 INFO L225 Difference]: With dead ends: 144 [2018-01-24 15:14:58,799 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 15:14:58,801 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=508, Invalid=4048, Unknown=0, NotChecked=0, Total=4556 [2018-01-24 15:14:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 15:14:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 96. [2018-01-24 15:14:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 15:14:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 15:14:58,810 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 29 [2018-01-24 15:14:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:58,810 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 15:14:58,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 15:14:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 15:14:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:14:58,811 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:14:58,811 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:14:58,811 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:14:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1810852380, now seen corresponding path program 1 times [2018-01-24 15:14:58,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:14:58,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:58,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:14:58,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:14:58,812 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:14:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:14:58,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:14:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:14:58,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:14:58,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:14:58,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:14:58,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:14:58,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:14:58,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:14:58,879 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 6 states. [2018-01-24 15:14:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:14:58,967 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-01-24 15:14:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:14:58,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 15:14:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:14:58,968 INFO L225 Difference]: With dead ends: 96 [2018-01-24 15:14:58,968 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:14:58,968 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 15:14:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:14:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:14:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:14:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:14:58,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-24 15:14:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:14:58,969 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:14:58,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:14:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:14:58,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:14:58,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:14:59,112 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 15:14:59,163 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 15:14:59,259 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 15:14:59,265 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 15:15:00,320 WARN L146 SmtUtils]: Spent 1034ms on a formula simplification. DAG size of input: 153 DAG size of output 125 [2018-01-24 15:15:00,846 WARN L146 SmtUtils]: Spent 522ms on a formula simplification. DAG size of input: 147 DAG size of output 117 [2018-01-24 15:15:00,957 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-24 15:15:01,130 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 88 DAG size of output 70 [2018-01-24 15:15:01,134 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 552) no Hoare annotation was computed. [2018-01-24 15:15:01,134 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 555) no Hoare annotation was computed. [2018-01-24 15:15:01,134 INFO L397 ceAbstractionStarter]: At program point cstrncpyENTRY(lines 540 557) the Hoare annotation is: (let ((.cse9 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse0 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse5 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse1 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse2 (< |cstrncpy_#in~n| .cse9)) (.cse3 (< .cse9 |cstrncpy_#in~n|)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse6 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse7 (< .cse9 1))) (and (or .cse0 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)) .cse1 .cse2 .cse3 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|)))))) (or .cse0 .cse4 .cse5 .cse1 .cse2 (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) (+ main_~nondetString~5.offset (select |#length| |cstrncpy_#in~s2.base|) (- 1)))))) .cse3 .cse8 .cse6 .cse7 (< (select |#length| |cstrncpy_#in~s2.base|) 1))))) [2018-01-24 15:15:01,134 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 15:15:01,134 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr5RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,134 INFO L401 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr2RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 552) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr3RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,135 INFO L397 ceAbstractionStarter]: At program point L551'''(lines 551 552) the Hoare annotation is: (let ((.cse17 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse6 (< (select |#length| |cstrncpy_#in~s2.base|) 1)) (.cse2 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse5 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse7 (< |cstrncpy_#in~n| .cse17)) (.cse15 (< .cse17 |cstrncpy_#in~n|)) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse3 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse9 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse10 (< .cse17 1)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse0 (<= cstrncpy_~dst~2.offset 1)) (.cse1 (let ((.cse16 (select |#length| cstrncpy_~src~2.base))) (or (<= .cse16 cstrncpy_~src~2.offset) (<= cstrncpy_~src~2.offset 1) (<= (+ cstrncpy_~src~2.offset 2) .cse16))))) (and (or (and (<= cstrncpy_~n2~2 0) (<= cstrncpy_~n 0) .cse0 .cse1 (<= cstrncpy_~us~2.offset 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 |cstrncpy_#in~n|) .cse8 .cse9 .cse10) (or .cse2 (let ((.cse14 (+ cstrncpy_~dst~2.offset cstrncpy_~n)) (.cse13 (select |#length| cstrncpy_~dst~2.base)) (.cse12 (select |#length| cstrncpy_~us~2.base)) (.cse11 (+ cstrncpy_~us~2.offset cstrncpy_~n2~2))) (and (<= .cse11 .cse12) (<= 1 cstrncpy_~dst~2.offset) (<= .cse13 .cse14) (<= 1 cstrncpy_~src~2.offset) (<= 1 cstrncpy_~us~2.offset) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) (+ main_~nondetString~5.offset (select |#length| cstrncpy_~src~2.base) (- 1)))))) (= 1 (select |#valid| cstrncpy_~src~2.base)) (= 1 (select |#valid| cstrncpy_~us~2.base)) (not (= cstrncpy_~src~2.base cstrncpy_~dst~2.base)) (<= .cse14 .cse13) (= 1 (select |#valid| cstrncpy_~dst~2.base)) (<= cstrncpy_~us~2.offset .cse12) (<= cstrncpy_~dst~2.offset .cse13) (<= .cse12 .cse11))) .cse4 .cse3 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse6) (or .cse2 .cse5 .cse7 .cse15 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse3 .cse9 .cse10) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|))))) (and .cse0 .cse1 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|))))))) [2018-01-24 15:15:01,136 INFO L397 ceAbstractionStarter]: At program point L546''(lines 546 555) the Hoare annotation is: (let ((.cse21 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse0 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse5 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse1 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse12 (< (select |#length| |cstrncpy_#in~s2.base|) 1)) (.cse9 (= 0 cstrncpy_~src~2.offset)) (.cse10 (<= cstrncpy_~dst~2.offset 1)) (.cse11 (select |#length| cstrncpy_~src~2.base)) (.cse2 (< |cstrncpy_#in~n| .cse21)) (.cse3 (< .cse21 |cstrncpy_#in~n|)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse6 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse7 (< .cse21 1))) (and (or .cse0 .cse1 .cse2 .cse3 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|))))) (and (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) cstrncpy_~src~2.offset)) .cse9 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)))) (or .cse0 .cse5 .cse4 (and (<= cstrncpy_~n 0) .cse10 (or (<= cstrncpy_~src~2.offset 1) (<= (+ cstrncpy_~src~2.offset 2) .cse11))) .cse1 .cse9 .cse12 .cse2 (< 1 |cstrncpy_#in~n|) .cse8 .cse6 .cse7) (let ((.cse14 (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) (+ main_~nondetString~5.offset (select |#length| cstrncpy_~src~2.base) (- 1))))))) (.cse15 (= 1 (select |#valid| cstrncpy_~src~2.base))) (.cse16 (not (= cstrncpy_~src~2.base cstrncpy_~dst~2.base))) (.cse17 (= 1 (select |#valid| cstrncpy_~dst~2.base))) (.cse13 (select |#length| cstrncpy_~dst~2.base))) (or .cse0 .cse4 .cse5 .cse1 .cse12 (and (<= cstrncpy_~n .cse13) (= 0 cstrncpy_~dst~2.offset) .cse14 .cse15 (<= .cse13 cstrncpy_~n) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) (+ main_~nondetString~5.offset (select |#length| |cstrncpy_#in~s2.base|) (- 1)))))) (= cstrncpy_~n |cstrncpy_#in~n|) .cse16 .cse9 .cse17 (<= 1 .cse11)) (let ((.cse19 (+ cstrncpy_~dst~2.offset cstrncpy_~n))) (and (let ((.cse18 (<= (+ cstrncpy_~src~2.offset 1) .cse11)) (.cse20 (<= cstrncpy_~dst~2.offset .cse13))) (or (and (<= 1 cstrncpy_~dst~2.offset) .cse18 .cse14 .cse15 (<= 2 cstrncpy_~src~2.offset) .cse16 (<= .cse19 .cse13) .cse17 .cse20) (and .cse10 .cse18 (<= 1 cstrncpy_~src~2.offset) .cse14 .cse15 .cse16 (<= (+ cstrncpy_~n 1) .cse13) .cse17 .cse20))) (<= .cse13 .cse19))) .cse2 .cse3 .cse8 .cse6 .cse7))))) [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point L546'''(lines 546 555) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr4RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,136 INFO L401 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-24 15:15:01,137 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-24 15:15:01,138 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:15:01,138 INFO L401 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-24 15:15:01,138 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-24 15:15:01,138 INFO L397 ceAbstractionStarter]: At program point L569'(line 569) the Hoare annotation is: (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= main_~n~5 (select |#length| |main_#t~malloc10.base|)) (<= 1 main_~n~5) (= (select |#length| main_~nondetArea~5.base) main_~n~5) (= 0 main_~nondetArea~5.offset) (= 0 |main_#t~malloc10.offset|) (= 0 |main_#t~malloc11.offset|) (= main_~nondetString~5.offset 0) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= main_~length~5 (select |#length| |main_#t~malloc11.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|)) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= (select (select |#memory_int| main_~nondetString~5.base) (+ main_~nondetString~5.offset (select |#length| main_~nondetString~5.base) (- 1))) 0) (<= main_~nondetString~5.offset 0))) (not (= main_~nondetArea~5.base |main_#t~malloc11.base|)) (= 1 (select |#valid| main_~nondetArea~5.base)) (= main_~length~5 (select |#length| main_~nondetString~5.base)) (= 1 (select |#valid| main_~nondetString~5.base)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0)) (not (= main_~nondetArea~5.base main_~nondetString~5.base)) (exists ((main_~length~5 Int)) (and (= (select (select |#memory_int| main_~nondetString~5.base) (+ main_~nondetString~5.offset main_~length~5 (- 1))) 0) (<= (+ main_~nondetString~5.offset main_~length~5) (select |#length| main_~nondetString~5.base)) (<= 1 main_~length~5)))) [2018-01-24 15:15:01,138 INFO L401 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-24 15:15:01,138 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-24 15:15:01,149 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,150 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,151 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,186 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,201 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,202 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,203 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,204 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,205 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,206 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,207 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,210 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,211 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,212 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,213 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,214 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,224 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,225 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,226 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,226 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,226 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,227 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,227 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:15:01 BoogieIcfgContainer [2018-01-24 15:15:01,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:15:01,253 INFO L168 Benchmark]: Toolchain (without parser) took 30329.23 ms. Allocated memory was 303.6 MB in the beginning and 1.1 GB in the end (delta: 826.3 MB). Free memory was 263.6 MB in the beginning and 944.7 MB in the end (delta: -681.0 MB). Peak memory consumption was 753.4 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:01,254 INFO L168 Benchmark]: CDTParser took 0.22 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 15:15:01,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.51 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 15:15:01,254 INFO L168 Benchmark]: Boogie Preprocessor took 38.50 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 15:15:01,254 INFO L168 Benchmark]: RCFGBuilder took 260.70 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 232.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:01,255 INFO L168 Benchmark]: TraceAbstraction took 29822.21 ms. Allocated memory was 303.6 MB in the beginning and 1.1 GB in the end (delta: 826.3 MB). Free memory was 232.7 MB in the beginning and 944.7 MB in the end (delta: -712.0 MB). Peak memory consumption was 722.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:15:01,256 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.22 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 199.51 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 38.50 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 260.70 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 232.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 29822.21 ms. Allocated memory was 303.6 MB in the beginning and 1.1 GB in the end (delta: 826.3 MB). Free memory was 232.7 MB in the beginning and 944.7 MB in the end (delta: -712.0 MB). Peak memory consumption was 722.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 248 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 20.498653 RENAME_VARIABLES(MILLISECONDS) : 1.089590 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 20.419695 PROJECTAWAY(MILLISECONDS) : 28.939526 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.101189 DISJOIN(MILLISECONDS) : 2.020593 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.126214 ADD_EQUALITY(MILLISECONDS) : 0.044460 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017747 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 124 #UNFREEZE : 0 #CONJOIN : 128 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 117 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 258 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 12.720226 RENAME_VARIABLES(MILLISECONDS) : 2.913928 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.654280 PROJECTAWAY(MILLISECONDS) : 51.213095 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091581 DISJOIN(MILLISECONDS) : 1.076572 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.946876 ADD_EQUALITY(MILLISECONDS) : 0.040011 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018909 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 131 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 381 LocStat_NO_SUPPORTING_DISEQUALITIES : 58 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 16.634758 RENAME_VARIABLES(MILLISECONDS) : 3.629202 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 16.583556 PROJECTAWAY(MILLISECONDS) : 18.120547 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029056 DISJOIN(MILLISECONDS) : 1.115699 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.662347 ADD_EQUALITY(MILLISECONDS) : 0.016272 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006817 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 124 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 97 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 79 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 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: 558]: 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 9 specifications checked. All of them hold - InvariantResult [Line: 546]: Loop Invariant [2018-01-24 15:15:01,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || (((!(\old(unknown-#memory_int-unknown)[s2][s2] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || !(0 == s2)) || !(\exists v_main_~nondetString~5.offset_BEFORE_CALL_2 : int, main_~length~5 : int :: ((s2 <= v_main_~nondetString~5.offset_BEFORE_CALL_2 && \old(unknown-#memory_int-unknown)[s2][v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 + -1] == 0) && 1 <= main_~length~5) && v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 <= unknown-#length-unknown[s2])) || ((0 == unknown-#memory_int-unknown[src][src] && 0 == src) && 0 == unknown-#memory_int-unknown[s2][s2])) && (((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || !(0 == s1)) || !(1 == \valid[s2])) || ((n <= 0 && dst <= 1) && (src <= 1 || src + 2 <= unknown-#length-unknown[src]))) || s1 == s2) || 0 == src) || unknown-#length-unknown[s2] < 1) || \old(n) < unknown-#length-unknown[s1]) || 1 < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1)) && (((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || unknown-#length-unknown[s2] < 1) || ((((((((((n <= unknown-#length-unknown[dst] && 0 == dst) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && 1 == \valid[src]) && unknown-#length-unknown[dst] <= n) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][main_~nondetString~5.offset + unknown-#length-unknown[s2] + -1])) && n == \old(n)) && !(src == dst)) && 0 == src) && 1 == \valid[dst]) && 1 <= unknown-#length-unknown[src])) || ((((((((((1 <= dst && src + 1 <= unknown-#length-unknown[src]) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && 1 == \valid[src]) && 2 <= src) && !(src == dst)) && dst + n <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && dst <= unknown-#length-unknown[dst]) || ((((((((dst <= 1 && src + 1 <= unknown-#length-unknown[src]) && 1 <= src) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && 1 == \valid[src]) && !(src == dst)) && n + 1 <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && dst <= unknown-#length-unknown[dst])) && unknown-#length-unknown[dst] <= dst + n)) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) - InvariantResult [Line: 551]: Loop Invariant [2018-01-24 15:15:01,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,295 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,296 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,297 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,298 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,298 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,299 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,300 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,301 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,302 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-24 15:15:01,306 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,306 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,306 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:15:01,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((n2 <= 0 && n <= 0) && dst <= 1) && ((unknown-#length-unknown[src] <= src || src <= 1) || src + 2 <= unknown-#length-unknown[src])) && us <= 1) || !(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0)) || !(0 == s1)) || !(1 == \valid[s2])) || s1 == s2) || unknown-#length-unknown[s2] < 1) || \old(n) < unknown-#length-unknown[s1]) || 1 < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) && ((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || (((((((((((((us + n2 <= unknown-#length-unknown[us] && 1 <= dst) && unknown-#length-unknown[dst] <= dst + n) && 1 <= src) && 1 <= us) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && 1 == \valid[src]) && 1 == \valid[us]) && !(src == dst)) && dst + n <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && us <= unknown-#length-unknown[us]) && dst <= unknown-#length-unknown[dst]) && unknown-#length-unknown[us] <= us + n2)) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || unknown-#length-unknown[s2] < 1)) && (((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || (((!(\old(unknown-#memory_int-unknown)[s2][s2] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || !(0 == s2)) || !(\exists v_main_~nondetString~5.offset_BEFORE_CALL_2 : int, main_~length~5 : int :: ((s2 <= v_main_~nondetString~5.offset_BEFORE_CALL_2 && \old(unknown-#memory_int-unknown)[s2][v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 + -1] == 0) && 1 <= main_~length~5) && v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 <= unknown-#length-unknown[s2])) || ((dst <= 1 && ((unknown-#length-unknown[src] <= src || src <= 1) || src + 2 <= unknown-#length-unknown[src])) && 0 == unknown-#memory_int-unknown[s2][s2])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 9 error locations. SAFE Result, 29.6s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 588 SDtfs, 925 SDslu, 3215 SDs, 0 SdLazy, 2449 SolverSat, 279 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 297 SyntacticMatches, 23 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 206 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 28 NumberOfFragments, 1182 HoareAnnotationTreeSize, 17 FomulaSimplifications, 3189 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3717 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 762 ConstructedInterpolants, 45 QuantifiedInterpolants, 188094 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 405 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 8/118 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/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-15-01-316.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-15-01-316.csv Received shutdown request...