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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:40:44,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:40:44,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:40:44,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:40:44,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:40:44,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:40:44,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:40:44,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:40:44,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:40:44,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:40:44,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:40:44,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:40:44,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:40:44,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:40:44,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:40:44,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:40:44,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:40:44,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:40:44,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:40:44,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:40:44,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:40:44,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:40:44,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:40:44,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:40:44,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:40:44,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:40:44,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:40:44,483 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:40:44,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:40:44,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:40:44,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:40:44,484 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:40:44,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:40:44,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:40:44,493 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:40:44,493 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:40:44,493 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:40:44,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:40:44,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:40:44,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:40:44,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:40:44,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:40:44,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:40:44,496 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:40:44,496 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:40:44,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:40:44,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:40:44,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:40:44,498 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:40:44,498 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:40:44,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:40:44,540 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:40:44,543 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:40:44,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:40:44,545 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:40:44,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:40:44,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:40:44,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:40:44,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:44,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:40:44,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:40:44,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3a9b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44, skipping insertion in model container [2018-01-24 11:40:44,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,728 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:44,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:44,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:44,895 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:44,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44 WrapperNode [2018-01-24 11:40:44,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:44,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:40:44,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:40:44,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:40:44,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (1/1) ... [2018-01-24 11:40:44,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:40:44,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:40:44,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:40:44,943 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:40:44,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (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 11:40:45,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:40:45,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:40:45,005 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 11:40:45,005 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:40:45,005 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:40:45,005 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:40:45,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:40:45,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:40:45,005 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:40:45,006 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:40:45,006 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 11:40:45,006 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:40:45,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:40:45,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:40:45,181 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:40:45,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:40:45 BoogieIcfgContainer [2018-01-24 11:40:45,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:40:45,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:40:45,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:40:45,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:40:45,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:40:44" (1/3) ... [2018-01-24 11:40:45,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:40:45, skipping insertion in model container [2018-01-24 11:40:45,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:44" (2/3) ... [2018-01-24 11:40:45,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6c5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:40:45, skipping insertion in model container [2018-01-24 11:40:45,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:40:45" (3/3) ... [2018-01-24 11:40:45,220 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:40:45,226 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:40:45,232 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 11:40:45,264 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:40:45,264 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:40:45,265 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:40:45,265 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:40:45,265 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:40:45,265 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:40:45,265 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:40:45,265 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:40:45,266 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:40:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 11:40:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:40:45,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:45,292 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:45,293 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 11:40:45,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:45,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:45,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:45,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:45,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:45,452 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 11:40:45,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:45,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:40:45,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:40:45,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:40:45,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:40:45,469 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 11:40:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:45,544 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 11:40:45,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:40:45,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:40:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:45,616 INFO L225 Difference]: With dead ends: 57 [2018-01-24 11:40:45,616 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 11:40:45,620 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:40:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 11:40:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 11:40:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 11:40:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 11:40:45,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 11:40:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:45,649 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 11:40:45,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:40:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 11:40:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:40:45,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:45,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:45,650 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 11:40:45,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:45,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:45,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:45,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:45,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:45,682 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 11:40:45,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:45,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:40:45,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:40:45,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:40:45,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:40:45,685 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 11:40:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:45,731 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 11:40:45,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:40:45,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 11:40:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:45,733 INFO L225 Difference]: With dead ends: 40 [2018-01-24 11:40:45,733 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 11:40:45,734 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:40:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 11:40:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 11:40:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:40:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 11:40:45,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 11:40:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:45,741 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 11:40:45,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:40:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 11:40:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:40:45,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:45,742 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:45,742 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 11:40:45,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:45,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:45,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:45,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:45,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:45,819 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 11:40:45,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:45,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:40:45,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:40:45,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:40:45,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:40:45,821 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 11:40:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:45,866 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 11:40:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:40:45,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 11:40:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:45,867 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:40:45,868 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:40:45,868 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 11:40:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:40:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:40:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:40:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:40:45,874 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 11:40:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:45,874 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:40:45,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:40:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:40:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:40:45,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:45,875 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:45,875 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 11:40:45,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:45,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:45,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:45,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:45,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:45,988 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 11:40:45,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:45,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:40:45,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:40:45,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:40:45,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:40:45,989 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 11:40:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:46,047 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 11:40:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:40:46,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:40:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:46,048 INFO L225 Difference]: With dead ends: 36 [2018-01-24 11:40:46,048 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 11:40:46,049 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 11:40:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 11:40:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 11:40:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 11:40:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 11:40:46,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 11:40:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:46,053 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 11:40:46,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:40:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 11:40:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:40:46,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:46,054 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 11:40:46,054 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-24 11:40:46,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:46,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:46,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:46,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:46,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:46,124 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 11:40:46,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:46,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:40:46,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:40:46,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:40:46,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:40:46,125 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 11:40:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:46,225 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 11:40:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:40:46,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 11:40:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:46,226 INFO L225 Difference]: With dead ends: 35 [2018-01-24 11:40:46,226 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 11:40:46,227 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 11:40:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 11:40:46,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 11:40:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 11:40:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 11:40:46,232 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-24 11:40:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:46,232 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 11:40:46,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:40:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 11:40:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:40:46,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:46,233 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 11:40:46,233 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-24 11:40:46,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:46,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:46,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:46,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:46,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:46,371 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 11:40:46,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:46,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:40:46,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:40:46,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:40:46,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:40:46,372 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-24 11:40:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:46,498 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 11:40:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:40:46,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 11:40:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:46,499 INFO L225 Difference]: With dead ends: 42 [2018-01-24 11:40:46,499 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:40:46,500 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 11:40:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:40:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-24 11:40:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:40:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 11:40:46,506 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-24 11:40:46,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:46,507 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 11:40:46,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:40:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 11:40:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:40:46,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:46,508 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:46,508 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-24 11:40:46,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:46,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:46,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:46,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:46,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:46,604 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 11:40:46,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:46,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:40:46,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:40:46,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:40:46,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:40:46,605 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-24 11:40:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:46,693 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 11:40:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:40:46,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 11:40:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:46,694 INFO L225 Difference]: With dead ends: 37 [2018-01-24 11:40:46,694 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 11:40:46,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:40:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 11:40:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 11:40:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 11:40:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 11:40:46,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-24 11:40:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:46,699 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 11:40:46,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:40:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 11:40:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:40:46,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:46,700 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:46,700 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-24 11:40:46,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:46,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:46,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:46,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:46,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:46,828 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 11:40:46,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:46,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:40:46,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:40:46,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:40:46,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:40:46,829 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-24 11:40:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:46,975 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 11:40:46,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:40:46,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 11:40:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:46,976 INFO L225 Difference]: With dead ends: 39 [2018-01-24 11:40:46,976 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 11:40:46,977 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:40:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 11:40:46,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 11:40:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:40:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 11:40:46,981 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-24 11:40:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:46,981 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 11:40:46,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:40:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 11:40:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:40:46,981 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:46,982 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:46,982 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-24 11:40:46,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:46,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:46,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:46,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:47,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:47,126 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 11:40:47,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:47,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 11:40:47,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 11:40:47,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 11:40:47,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:40:47,127 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 11:40:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:47,257 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-24 11:40:47,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:40:47,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 11:40:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:47,258 INFO L225 Difference]: With dead ends: 77 [2018-01-24 11:40:47,258 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 11:40:47,259 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 11:40:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 11:40:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-24 11:40:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:40:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 11:40:47,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 11:40:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:47,265 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 11:40:47,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 11:40:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 11:40:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:40:47,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:47,266 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:47,266 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-24 11:40:47,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:47,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:47,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:47,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:47,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:47,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:47,497 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 11:40:47,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:40:47,497 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:40:47,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:47,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:40:47,571 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 11:40:47,573 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 11:40:47,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:47,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:47,586 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 11:40:47,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:40:47,718 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 11:40:47,734 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 11:40:47,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:40:47,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:47,751 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 11:40:47,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 11:40:47,789 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 11:40:47,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:40:47,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-01-24 11:40:47,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:40:47,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:40:47,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:40:47,810 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-24 11:40:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:48,298 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 11:40:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 11:40:48,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 11:40:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:48,302 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:40:48,302 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 11:40:48,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:40:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 11:40:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 11:40:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 11:40:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 11:40:48,313 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-24 11:40:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:48,313 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 11:40:48,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:40:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 11:40:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:40:48,314 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:48,315 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:48,315 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-24 11:40:48,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:48,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:48,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:48,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:48,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:48,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:48,666 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 11:40:48,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:40:48,666 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:40:48,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:48,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:40:48,704 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 11:40:48,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:48,710 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 11:40:48,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:48,715 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 11:40:48,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 11:40:48,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:40:48,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:40:48,760 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 11:40:48,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:48,768 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 11:40:48,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:48,773 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 11:40:48,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 11:40:49,099 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 11:40:49,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:40:49,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-01-24 11:40:49,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:40:49,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:40:49,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:40:49,121 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2018-01-24 11:40:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:49,824 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 11:40:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:40:49,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-24 11:40:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:49,825 INFO L225 Difference]: With dead ends: 62 [2018-01-24 11:40:49,825 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 11:40:49,826 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 11:40:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 11:40:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-24 11:40:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:40:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 11:40:49,835 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-24 11:40:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:49,835 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 11:40:49,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:40:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 11:40:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:40:49,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:49,837 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:49,837 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-01-24 11:40:49,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:49,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:49,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:49,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:40:49,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:49,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:50,273 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 11:40:50,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:40:50,310 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:40:50,316 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:40:50,329 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:40:50,335 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:40:50,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:40:50,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:40:50,343 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 11:40:50,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 11:40:50,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:40:50,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:40:50,350 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 11:40:50,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:40:50,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 11:40:50,399 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 11:40:50,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 13 treesize of output 12 [2018-01-24 11:40:50,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,407 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 11:40:50,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 11:40:50,536 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 11:40:50,538 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 11:40:50,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:40:50,548 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 11:40:50,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 11:40:50,610 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 11:40:50,616 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 11:40:50,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:40:50,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:40:50,627 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 11:40:50,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 11:40:50,678 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 11:40:50,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:40:50,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-01-24 11:40:50,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 11:40:50,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 11:40:50,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:40:50,709 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2018-01-24 11:40:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:51,634 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 11:40:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:40:51,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-01-24 11:40:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:51,636 INFO L225 Difference]: With dead ends: 61 [2018-01-24 11:40:51,636 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 11:40:51,637 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 11:40:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 11:40:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-24 11:40:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:40:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-01-24 11:40:51,643 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2018-01-24 11:40:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:51,643 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-01-24 11:40:51,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 11:40:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-01-24 11:40:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 11:40:51,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:40:51,644 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:40:51,644 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:40:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-01-24 11:40:51,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:40:51,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:40:51,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:51,645 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:40:51,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:40:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:40:51,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:40:51,745 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 11:40:51,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:40:51,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:40:51,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:40:51,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:40:51,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:40:51,746 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-01-24 11:40:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:40:51,834 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-24 11:40:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:40:51,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 11:40:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:40:51,834 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:40:51,834 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:40:51,835 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 11:40:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:40:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:40:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:40:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:40:51,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-24 11:40:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:40:51,836 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:40:51,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:40:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:40:51,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:40:51,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:40:52,287 WARN L146 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 75 DAG size of output 52 [2018-01-24 11:40:52,674 WARN L146 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 126 DAG size of output 90 [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:40:52,751 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L397 ceAbstractionStarter]: At program point L544'''''(lines 544 545) the Hoare annotation is: (let ((.cse18 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse1 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse3 (= 0 cstrcpy_~src~2.offset)) (.cse4 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse6 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse8 (not (= 0 |cstrcpy_#in~s1.offset|))) (.cse0 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse2 (< (select |#length| |cstrcpy_#in~s1.base|) .cse18)) (.cse5 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse7 (< .cse18 1))) (and (or (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse0 .cse1 .cse2 (and (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~src~2.base) cstrcpy_~src~2.offset)) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse12 (select |#length| cstrcpy_~src~2.base)) (.cse17 (select |#length| cstrcpy_~dst~2.base))) (let ((.cse9 (not (= cstrcpy_~src~2.base cstrcpy_~dst~2.base))) (.cse15 (<= 1 cstrcpy_~dst~2.offset)) (.cse10 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse11 (<= .cse12 .cse17)) (.cse16 (<= (+ cstrcpy_~src~2.offset 1) .cse12)) (.cse13 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse14 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| cstrcpy_~src~2.base) (+ main_~nondetString~3.offset (select |#length| cstrcpy_~src~2.base) (- 1))) 0) (<= main_~nondetString~3.offset 0))))) (or .cse1 (and .cse9 (= 0 cstrcpy_~dst~2.offset) .cse10 .cse3 .cse11 (<= 1 .cse12) (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse13 .cse14) .cse4 .cse6 .cse8 (and .cse9 .cse15 .cse10 (<= 2 cstrcpy_~src~2.offset) .cse16 .cse13 .cse14 (<= (+ cstrcpy_~dst~2.offset .cse12) (+ cstrcpy_~src~2.offset .cse17))) .cse0 .cse2 .cse5 (and .cse9 .cse15 .cse10 (<= cstrcpy_~dst~2.offset 1) .cse11 .cse16 .cse13 .cse14 (<= 1 cstrcpy_~src~2.offset)) .cse7)))))) [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 11:40:52,752 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 547) the Hoare annotation is: (let ((.cse8 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (not (= 0 |cstrcpy_#in~s2.offset|))) (.cse1 (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1))) (.cse2 (< (select |#length| |cstrcpy_#in~s1.base|) .cse8)) (.cse3 (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (.cse4 (not (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))))) (.cse5 (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|)))) (.cse6 (< .cse8 1)) (.cse7 (not (= 0 |cstrcpy_#in~s1.offset|)))) (and (or (not (= (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|) 0)) .cse0 (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 (exists ((main_~nondetString~3.offset Int)) (and (<= 0 main_~nondetString~3.offset) (= (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ main_~nondetString~3.offset (select |#length| |cstrcpy_#in~s2.base|) (- 1))) 0) (<= main_~nondetString~3.offset 0))) .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-01-24 11:40:52,752 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:40:52,753 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L397 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 main_~nondetArea~3.offset) (= 0 |main_#t~malloc6.offset|) (not (= main_~nondetArea~3.base main_~nondetString~3.base)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~3 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~3.base |main_#t~malloc7.base|)) (= 1 (select |#valid| main_~nondetArea~3.base)) (<= main_~length2~3 main_~length1~3) (= 0 |main_#t~malloc7.offset|) (= main_~length2~3 (select |#length| |main_#t~malloc7.base|)) (= main_~length2~3 .cse0) (exists ((main_~nondetString~3.offset Int)) (and (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ (select |#length| main_~nondetString~3.base) main_~nondetString~3.offset (- 1)))) (<= 0 main_~nondetString~3.offset) (<= main_~nondetString~3.offset 0))) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= 0 main_~nondetString~3.offset) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (<= 1 main_~length2~3) (= (select |#valid| |main_#t~malloc6.base|) 1) (<= .cse0 (select |#length| main_~nondetArea~3.base)))) [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 11:40:52,754 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 11:40:52,764 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,765 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,766 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,766 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,767 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,767 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,767 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,768 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,768 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,768 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,769 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,770 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,771 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,773 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,774 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,776 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:40:52 BoogieIcfgContainer [2018-01-24 11:40:52,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:40:52,803 INFO L168 Benchmark]: Toolchain (without parser) took 8101.12 ms. Allocated memory was 303.6 MB in the beginning and 573.6 MB in the end (delta: 270.0 MB). Free memory was 262.5 MB in the beginning and 415.1 MB in the end (delta: -152.6 MB). Peak memory consumption was 191.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:52,804 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:40:52,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.55 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:52,805 INFO L168 Benchmark]: Boogie Preprocessor took 39.94 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 11:40:52,805 INFO L168 Benchmark]: RCFGBuilder took 271.22 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 233.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:52,806 INFO L168 Benchmark]: TraceAbstraction took 7588.43 ms. Allocated memory was 303.6 MB in the beginning and 573.6 MB in the end (delta: 270.0 MB). Free memory was 233.6 MB in the beginning and 415.1 MB in the end (delta: -181.5 MB). Peak memory consumption was 162.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:40:52,807 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.12 ms. Allocated memory is still 303.6 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 193.55 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.94 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 271.22 ms. Allocated memory is still 303.6 MB. Free memory was 250.5 MB in the beginning and 233.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7588.43 ms. Allocated memory was 303.6 MB in the beginning and 573.6 MB in the end (delta: 270.0 MB). Free memory was 233.6 MB in the beginning and 415.1 MB in the end (delta: -181.5 MB). Peak memory consumption was 162.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 11:40:52,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,816 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,817 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,820 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,820 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,823 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,825 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,826 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,828 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,829 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,830 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,831 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,832 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,833 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~3.offset,QUANTIFIED] [2018-01-24 11:40:52,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,833 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,834 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,835 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,836 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:40:52,837 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:40:52,838 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((!(\old(unknown-#memory_int-unknown)[s2][s2] == 0) || !(0 == s2)) || !(\valid[s1] == 1)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || ((0 == unknown-#memory_int-unknown[s2][s2] && 0 == unknown-#memory_int-unknown[src][src]) && 0 == src)) || s1 == s2) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || !(1 == \valid[s2])) || unknown-#length-unknown[s2] < 1) || !(0 == s1)) && ((((((((((!(\valid[s1] == 1) || ((((((((!(src == dst) && 0 == dst) && 1 == \valid[src]) && 0 == src) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && 1 <= unknown-#length-unknown[src]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[s2][main_~nondetString~3.offset + unknown-#length-unknown[s2] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0))) || s1 == s2) || !(1 == \valid[s2])) || !(0 == s1)) || (((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && 2 <= src) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && dst + unknown-#length-unknown[src] <= src + unknown-#length-unknown[dst])) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || !(\exists main_~nondetString~3.offset : int :: (0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~3.offset + -1] && 0 <= main_~nondetString~3.offset) && main_~nondetString~3.offset <= 0)) || ((((((((!(src == dst) && 1 <= dst) && 1 == \valid[src]) && dst <= 1) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && (\exists main_~nondetString~3.offset : int :: (0 <= main_~nondetString~3.offset && unknown-#memory_int-unknown[src][main_~nondetString~3.offset + unknown-#length-unknown[src] + -1] == 0) && main_~nondetString~3.offset <= 0)) && 1 <= src)) || unknown-#length-unknown[s2] < 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 7.4s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 470 SDslu, 1702 SDs, 0 SdLazy, 1508 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 604 HoareAnnotationTreeSize, 9 FomulaSimplifications, 182 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 698 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 320 ConstructedInterpolants, 16 QuantifiedInterpolants, 60450 SizeOfPredicates, 44 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-40-52-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-40-52-843.csv Received shutdown request...