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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:20:19,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:20:19,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:20:19,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:20:19,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:20:19,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:20:19,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:20:19,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:20:19,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:20:19,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:20:19,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:20:19,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:20:19,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:20:19,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:20:19,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:20:19,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:20:19,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:20:19,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:20:19,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:20:19,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:20:19,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:20:19,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:20:19,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:20:19,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:20:19,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:20:19,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:20:19,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:20:19,592 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:20:19,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:20:19,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:20:19,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:20:19,593 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:20:19,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:20:19,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:20:19,604 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:20:19,604 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:20:19,604 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:20:19,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:20:19,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:20:19,604 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:20:19,605 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:20:19,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:20:19,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:20:19,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:20:19,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:20:19,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:20:19,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:20:19,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:20:19,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:20:19,607 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:20:19,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:20:19,649 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:20:19,652 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:20:19,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:20:19,654 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:20:19,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:20:19,868 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:20:19,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:20:19,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:20:19,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:20:19,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:20:19,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:20:19" (1/1) ... [2018-02-04 17:20:19,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3ffa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:19, skipping insertion in model container [2018-02-04 17:20:19,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:20:19" (1/1) ... [2018-02-04 17:20:19,893 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:20:19,924 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:20:20,017 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:20:20,029 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:20:20,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20 WrapperNode [2018-02-04 17:20:20,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:20:20,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:20:20,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:20:20,033 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:20:20,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... [2018-02-04 17:20:20,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:20:20,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:20:20,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:20:20,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:20:20,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:20:20,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:20:20,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:20:20,090 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-04 17:20:20,090 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:20:20,090 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:20:20,090 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:20:20,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:20:20,215 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:20:20,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:20:20 BoogieIcfgContainer [2018-02-04 17:20:20,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:20:20,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:20:20,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:20:20,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:20:20,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:20:19" (1/3) ... [2018-02-04 17:20:20,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f09bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:20:20, skipping insertion in model container [2018-02-04 17:20:20,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:20:20" (2/3) ... [2018-02-04 17:20:20,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f09bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:20:20, skipping insertion in model container [2018-02-04 17:20:20,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:20:20" (3/3) ... [2018-02-04 17:20:20,220 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:20:20,225 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:20:20,229 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 17:20:20,256 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:20:20,256 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:20:20,256 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:20:20,257 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:20:20,257 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:20:20,257 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:20:20,257 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:20:20,257 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:20:20,258 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:20:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 17:20:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:20:20,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:20,277 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:20,277 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-04 17:20:20,284 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:20,284 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:20,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:20,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:20,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:20,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:20,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:20:20,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:20:20,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:20:20,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:20:20,412 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 17:20:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:20,499 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 17:20:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:20:20,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:20:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:20,506 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:20:20,506 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:20:20,508 INFO L554 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-02-04 17:20:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:20:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 17:20:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:20:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 17:20:20,571 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-04 17:20:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:20,572 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 17:20:20,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:20:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 17:20:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:20:20,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:20,572 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:20,572 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-04 17:20:20,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:20,573 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:20,573 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:20,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:20,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:20,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:20,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:20:20,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:20:20,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:20:20,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:20:20,592 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-04 17:20:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:20,613 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 17:20:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:20:20,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 17:20:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:20,614 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:20:20,614 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:20:20,614 INFO L554 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-02-04 17:20:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:20:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 17:20:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:20:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 17:20:20,617 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 17:20:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:20,617 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 17:20:20,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:20:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 17:20:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:20:20,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:20,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:20,618 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-04 17:20:20,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:20,618 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:20,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:20,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:20,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:20,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:20,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:20:20,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:20:20,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:20:20,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:20:20,667 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 17:20:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:20,744 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 17:20:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:20:20,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:20:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:20,745 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:20:20,745 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:20:20,745 INFO L554 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-02-04 17:20:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:20:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:20:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:20:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:20:20,749 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 17:20:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:20,749 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:20:20,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:20:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:20:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:20:20,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:20,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:20,750 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-04 17:20:20,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:20,751 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:20,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:20,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:20,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:20,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:20,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:20:20,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:20:20,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:20:20,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:20:20,842 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 17:20:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:20,887 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:20:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:20:20,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:20:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:20,888 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:20:20,888 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:20:20,889 INFO L554 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-02-04 17:20:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:20:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:20:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:20:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:20:20,892 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 17:20:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:20,892 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:20:20,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:20:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:20:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:20:20,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:20,893 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:20,893 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-02-04 17:20:20,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:20,894 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:20,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:20,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:20,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:20,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:20,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:20:20,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:20:20,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:20:20,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:20:20,959 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-04 17:20:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:21,026 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 17:20:21,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:20:21,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:20:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:21,027 INFO L225 Difference]: With dead ends: 34 [2018-02-04 17:20:21,027 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 17:20:21,027 INFO L554 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-02-04 17:20:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 17:20:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 17:20:21,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 17:20:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 17:20:21,030 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-02-04 17:20:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:21,030 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 17:20:21,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:20:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 17:20:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:20:21,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:21,031 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:21,031 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-02-04 17:20:21,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:21,032 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:21,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:21,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:21,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:21,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:21,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:20:21,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:20:21,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:20:21,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:20:21,119 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-02-04 17:20:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:21,188 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:20:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:20:21,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 17:20:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:21,189 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:20:21,189 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:20:21,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:20:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:20:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-04 17:20:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:20:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 17:20:21,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-02-04 17:20:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:21,192 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 17:20:21,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:20:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 17:20:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:20:21,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:21,192 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:21,192 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-02-04 17:20:21,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:21,193 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:21,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:21,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:21,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:21,212 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:21,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:21,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:21,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:21,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:21,297 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-02-04 17:20:21,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:20:21,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:21,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:21,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 17:20:21,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:20:21,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:20:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:21,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:21,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:20:21,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:20:21,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:20:21,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:20:21,396 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2018-02-04 17:20:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:21,529 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 17:20:21,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:20:21,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 17:20:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:21,529 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:20:21,530 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:20:21,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:20:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:20:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:20:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:20:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:20:21,532 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-02-04 17:20:21,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:21,532 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:20:21,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:20:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:20:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:20:21,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:21,533 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:21,533 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-02-04 17:20:21,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:21,533 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:21,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,534 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:21,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:21,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:21,546 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:21,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:21,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:21,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:21,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:21,592 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-02-04 17:20:21,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,599 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-02-04 17:20:21,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-02-04 17:20:21,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:21,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:21,640 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-02-04 17:20:21,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,653 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-02-04 17:20:21,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:21,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 17:20:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:21,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:21,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:20:21,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:20:21,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:20:21,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:20:21,779 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 13 states. [2018-02-04 17:20:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:22,111 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-04 17:20:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:20:22,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-04 17:20:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:22,112 INFO L225 Difference]: With dead ends: 66 [2018-02-04 17:20:22,112 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 17:20:22,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:20:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 17:20:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-02-04 17:20:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:20:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 17:20:22,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 20 [2018-02-04 17:20:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:22,115 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 17:20:22,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:20:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 17:20:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:20:22,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:22,116 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:22,116 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:22,116 INFO L82 PathProgramCache]: Analyzing trace with hash 64866927, now seen corresponding path program 1 times [2018-02-04 17:20:22,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:22,116 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:22,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:22,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:22,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:22,124 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:22,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:22,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:22,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:22,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:22,152 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-02-04 17:20:22,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,157 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-02-04 17:20:22,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:22,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:22,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:22,173 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-02-04 17:20:22,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,178 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-02-04 17:20:22,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-02-04 17:20:22,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:22,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:22,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:20:22,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:20:22,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:20:22,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:20:22,217 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 9 states. [2018-02-04 17:20:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:22,313 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-04 17:20:22,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:20:22,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 17:20:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:22,316 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:20:22,316 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:20:22,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:20:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:20:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2018-02-04 17:20:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:20:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 17:20:22,319 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-02-04 17:20:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:22,320 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 17:20:22,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:20:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 17:20:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:20:22,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:22,320 INFO L351 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-02-04 17:20:22,320 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-02-04 17:20:22,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:22,321 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:22,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:22,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:22,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:22,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:22,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:20:22,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:20:22,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:20:22,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:20:22,399 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-04 17:20:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:22,480 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 17:20:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:20:22,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 17:20:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:22,481 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:20:22,481 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:20:22,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:20:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:20:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-02-04 17:20:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:20:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 17:20:22,484 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-04 17:20:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:22,485 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 17:20:22,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:20:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 17:20:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:20:22,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:22,485 INFO L351 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-02-04 17:20:22,485 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-02-04 17:20:22,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:22,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:22,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:22,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:22,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:22,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:22,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:22,636 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:22,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:22,663 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-02-04 17:20:22,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:20:22,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:20:22,692 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-02-04 17:20:22,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:22,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:20:22,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-04 17:20:22,804 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-02-04 17:20:22,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:22,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:22,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:22,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-02-04 17:20:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:22,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:20:22,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-02-04 17:20:22,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:20:22,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:20:22,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:20:22,903 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 21 states. [2018-02-04 17:20:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:23,213 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 17:20:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:20:23,214 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-02-04 17:20:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:23,214 INFO L225 Difference]: With dead ends: 60 [2018-02-04 17:20:23,214 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 17:20:23,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:20:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 17:20:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 17:20:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 17:20:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 17:20:23,217 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-02-04 17:20:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:23,217 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 17:20:23,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:20:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 17:20:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:20:23,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:23,218 INFO L351 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-02-04 17:20:23,218 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-02-04 17:20:23,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:23,218 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:23,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:23,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:23,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:23,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:23,238 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:23,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:23,238 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:23,239 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:23,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:23,317 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-02-04 17:20:23,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,326 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-02-04 17:20:23,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-02-04 17:20:23,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:23,369 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-02-04 17:20:23,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:23,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:23,382 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-02-04 17:20:23,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:23,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 17:20:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:23,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:23,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:20:23,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:20:23,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:20:23,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:20:23,604 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 16 states. [2018-02-04 17:20:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:23,981 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-02-04 17:20:23,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:20:23,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-02-04 17:20:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:23,982 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:20:23,982 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:20:23,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:20:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:20:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-02-04 17:20:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 17:20:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 17:20:23,985 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 25 [2018-02-04 17:20:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:23,985 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 17:20:23,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:20:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 17:20:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:20:23,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:23,985 INFO L351 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-02-04 17:20:23,985 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-02-04 17:20:23,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:23,986 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:23,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:23,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:23,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:23,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:24,007 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:24,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:24,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:24,008 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:24,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:24,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:24,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:24,079 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-02-04 17:20:24,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:20:24,092 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-02-04 17:20:24,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,098 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-02-04 17:20:24,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:20:24,111 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-02-04 17:20:24,113 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-02-04 17:20:24,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 17:20:24,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 17:20:24,179 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-02-04 17:20:24,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-02-04 17:20:24,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:20:24,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:20:24,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:24,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:24,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:24,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-02-04 17:20:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:24,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:24,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:20:24,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:20:24,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:20:24,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:20:24,326 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 16 states. [2018-02-04 17:20:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:24,553 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 17:20:24,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:20:24,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-02-04 17:20:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:24,554 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:20:24,554 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:20:24,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:20:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:20:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-02-04 17:20:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:20:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-02-04 17:20:24,557 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 29 [2018-02-04 17:20:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:24,557 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-02-04 17:20:24,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:20:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-02-04 17:20:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:20:24,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:24,557 INFO L351 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-02-04 17:20:24,557 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-02-04 17:20:24,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:24,558 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:24,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:24,558 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:24,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:24,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:24,566 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:24,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:24,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:24,567 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:24,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:24,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-04 17:20:24,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 15 [2018-02-04 17:20:24,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:20:24,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:20:24,652 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |c_main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0))))) is different from true [2018-02-04 17:20:24,658 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc6.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc6.base| 1))) (and (= 0 (select .cse0 |main_#t~malloc7.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc6.base|)) (= (store (store (store .cse0 |main_#t~malloc7.base| 1) |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0) |c_#valid|)))) is different from true [2018-02-04 17:20:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:24,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:20:24,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:20:24,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:20:24,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:20:24,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:20:24,663 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-02-04 17:20:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:24,703 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 17:20:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:20:24,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-04 17:20:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:24,704 INFO L225 Difference]: With dead ends: 61 [2018-02-04 17:20:24,704 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:20:24,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-02-04 17:20:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:20:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:20:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:20:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-02-04 17:20:24,707 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-02-04 17:20:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:24,707 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-02-04 17:20:24,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:20:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-02-04 17:20:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 17:20:24,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:24,708 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:24,708 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash -342867985, now seen corresponding path program 2 times [2018-02-04 17:20:24,708 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:24,708 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:24,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:24,709 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:24,709 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:24,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:24,726 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:24,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:24,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:24,727 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:24,768 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:24,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:24,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:24,782 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-02-04 17:20:24,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,789 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-02-04 17:20:24,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:24,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,815 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-02-04 17:20:24,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:24,828 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-02-04 17:20:24,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:24,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:24,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:24,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:20:24,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:20:24,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:20:24,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:20:24,983 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 15 states. [2018-02-04 17:20:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:25,326 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-02-04 17:20:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:20:25,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-02-04 17:20:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:25,327 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:20:25,327 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:20:25,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:20:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:20:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 17:20:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:20:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-04 17:20:25,329 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2018-02-04 17:20:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:25,329 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-04 17:20:25,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:20:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-04 17:20:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:20:25,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:25,329 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:25,329 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash 678185859, now seen corresponding path program 3 times [2018-02-04 17:20:25,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:25,330 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:25,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:25,330 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:25,330 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:25,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:25,356 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:25,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:25,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:25,357 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:25,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:20:25,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:25,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:25,402 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-02-04 17:20:25,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:20:25,410 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-02-04 17:20:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:25,417 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-02-04 17:20:25,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:20:25,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 17:20:25,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:20:25,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:20:25,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 17:20:25,500 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-02-04 17:20:25,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-02-04 17:20:25,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 17:20:25,529 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-02-04 17:20:25,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:25,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-02-04 17:20:25,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 17:20:25,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 17:20:25,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:25,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:25,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:20:25,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-04 17:20:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:20:25,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:25,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:20:25,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:20:25,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:20:25,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:20:25,614 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 16 states. [2018-02-04 17:20:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:26,009 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-02-04 17:20:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:20:26,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-04 17:20:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:26,010 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:20:26,010 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:20:26,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:20:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:20:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:20:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:20:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-02-04 17:20:26,012 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-02-04 17:20:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:26,012 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-02-04 17:20:26,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:20:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-02-04 17:20:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 17:20:26,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:26,013 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:26,013 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -451074901, now seen corresponding path program 3 times [2018-02-04 17:20:26,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:26,014 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:26,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:26,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:26,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:26,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:26,036 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:26,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:26,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:26,037 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:26,064 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:20:26,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:26,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:26,077 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-02-04 17:20:26,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:20:26,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:20:26,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:26,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:20:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:26,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:26,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:20:26,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:20:26,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:20:26,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:20:26,246 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 15 states. [2018-02-04 17:20:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:26,541 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-04 17:20:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:20:26,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-04 17:20:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:26,542 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:20:26,542 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 17:20:26,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:20:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 17:20:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-02-04 17:20:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:20:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-04 17:20:26,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-02-04 17:20:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:26,544 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-04 17:20:26,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:20:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-04 17:20:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 17:20:26,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:26,545 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:26,545 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1422775663, now seen corresponding path program 4 times [2018-02-04 17:20:26,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:26,545 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:26,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:26,546 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:26,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:26,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:26,579 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:26,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:26,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:26,581 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:20:26,613 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:20:26,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:26,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:26,631 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-02-04 17:20:26,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,639 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-02-04 17:20:26,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:26,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:26,662 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-02-04 17:20:26,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:26,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:26,672 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-02-04 17:20:26,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:26,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:26,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:26,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:20:26,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:20:26,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:20:26,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:20:26,887 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2018-02-04 17:20:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:27,333 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-04 17:20:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:20:27,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-02-04 17:20:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:27,334 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:20:27,334 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:20:27,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:20:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:20:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-02-04 17:20:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:20:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 17:20:27,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-02-04 17:20:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:27,336 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 17:20:27,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:20:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 17:20:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 17:20:27,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:27,336 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:27,336 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash -696189141, now seen corresponding path program 5 times [2018-02-04 17:20:27,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:27,337 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:27,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:27,337 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:27,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:27,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:27,376 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:27,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:27,377 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:27,377 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:20:27,422 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:20:27,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:27,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:27,431 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-02-04 17:20:27,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,438 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-02-04 17:20:27,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:27,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:27,467 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-02-04 17:20:27,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:27,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:27,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:20:27,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:27,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:27,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:27,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:20:27,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:20:27,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:20:27,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:20:27,700 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-02-04 17:20:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:28,180 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 17:20:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:20:28,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-02-04 17:20:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:28,180 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:20:28,181 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 17:20:28,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:20:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 17:20:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-02-04 17:20:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:20:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 17:20:28,182 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-02-04 17:20:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:28,182 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 17:20:28,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:20:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 17:20:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 17:20:28,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:28,183 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:28,183 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1540453649, now seen corresponding path program 6 times [2018-02-04 17:20:28,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:28,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:28,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:28,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:28,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:28,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:28,213 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:28,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:28,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:28,213 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:20:28,266 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:20:28,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:28,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:28,278 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-02-04 17:20:28,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:28,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:28,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:20:28,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:20:28,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:28,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:28,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:20:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:28,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:28,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:20:28,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:20:28,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:20:28,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:20:28,506 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states. [2018-02-04 17:20:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:28,943 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-02-04 17:20:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:20:28,943 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-02-04 17:20:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:28,943 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:20:28,943 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:20:28,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:20:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:20:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-04 17:20:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:20:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-02-04 17:20:28,946 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-02-04 17:20:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:28,946 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-02-04 17:20:28,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:20:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-02-04 17:20:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:20:28,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:28,950 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:28,951 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash -625624661, now seen corresponding path program 7 times [2018-02-04 17:20:28,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:28,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:28,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:28,952 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:28,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:28,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:28,994 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:28,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:28,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:28,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:29,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:29,052 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-02-04 17:20:29,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,057 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-02-04 17:20:29,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:29,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:29,075 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-02-04 17:20:29,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:29,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:29,084 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-02-04 17:20:29,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:29,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:29,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:29,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:20:29,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:20:29,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:20:29,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:20:29,358 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 19 states. [2018-02-04 17:20:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:30,142 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-02-04 17:20:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:20:30,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-04 17:20:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:30,143 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:20:30,143 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:20:30,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:20:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:20:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-02-04 17:20:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 17:20:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-02-04 17:20:30,145 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-02-04 17:20:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:30,145 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-02-04 17:20:30,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:20:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-02-04 17:20:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 17:20:30,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:30,146 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:30,146 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1615487087, now seen corresponding path program 8 times [2018-02-04 17:20:30,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:30,147 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:30,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:30,147 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:30,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:30,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:30,205 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:30,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:30,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:30,205 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:30,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:30,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:30,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:30,304 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-02-04 17:20:30,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,311 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-02-04 17:20:30,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:30,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:30,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:30,336 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-02-04 17:20:30,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,351 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-02-04 17:20:30,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:30,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:30,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:30,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 17:20:30,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:20:30,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:20:30,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:20:30,657 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 20 states. [2018-02-04 17:20:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:31,207 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 17:20:31,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:20:31,207 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-04 17:20:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:31,208 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:20:31,208 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:20:31,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:20:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:20:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-02-04 17:20:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 17:20:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-02-04 17:20:31,210 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 60 [2018-02-04 17:20:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:31,210 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-02-04 17:20:31,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:20:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-02-04 17:20:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 17:20:31,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:31,211 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:31,211 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash -903654357, now seen corresponding path program 9 times [2018-02-04 17:20:31,211 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:31,212 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:31,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:31,212 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:31,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:31,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:31,241 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:31,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:31,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:31,242 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:31,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:20:31,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:31,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:31,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:20:31,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,346 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-02-04 17:20:31,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:31,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:31,370 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-02-04 17:20:31,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:31,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:31,379 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-02-04 17:20:31,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:31,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:31,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:31,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:20:31,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:20:31,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:20:31,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:20:31,601 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 21 states. [2018-02-04 17:20:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:32,192 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-02-04 17:20:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:20:32,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 17:20:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:32,193 INFO L225 Difference]: With dead ends: 72 [2018-02-04 17:20:32,193 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 17:20:32,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:20:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 17:20:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-02-04 17:20:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 17:20:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-02-04 17:20:32,195 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 65 [2018-02-04 17:20:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:32,195 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-02-04 17:20:32,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:20:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-02-04 17:20:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:20:32,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:32,196 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:32,196 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1313253905, now seen corresponding path program 10 times [2018-02-04 17:20:32,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:32,196 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:32,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:32,197 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:32,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:32,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:32,227 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:32,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:32,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:32,228 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:20:32,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:20:32,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:32,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:32,308 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-02-04 17:20:32,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,332 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-02-04 17:20:32,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:32,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:32,354 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-02-04 17:20:32,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:32,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:32,362 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-02-04 17:20:32,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:32,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:32,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:32,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 17:20:32,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:20:32,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:20:32,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:20:32,758 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 24 states. [2018-02-04 17:20:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:33,628 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-02-04 17:20:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:20:33,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2018-02-04 17:20:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:33,629 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:20:33,629 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:20:33,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=2002, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:20:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:20:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-02-04 17:20:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 17:20:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 17:20:33,631 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2018-02-04 17:20:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:33,631 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 17:20:33,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:20:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 17:20:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 17:20:33,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:33,632 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:33,632 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 456249003, now seen corresponding path program 11 times [2018-02-04 17:20:33,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:33,632 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:33,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:33,632 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:33,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:33,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:33,758 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:33,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:33,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:33,758 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:20:33,812 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:20:33,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:33,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:33,826 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-02-04 17:20:33,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:33,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:33,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:20:33,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:20:33,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:33,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:33,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:20:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:34,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:34,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:20:34,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:20:34,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:20:34,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:20:34,144 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 22 states. [2018-02-04 17:20:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:34,858 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-02-04 17:20:34,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:20:34,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-02-04 17:20:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:34,859 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:20:34,859 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:20:34,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:20:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:20:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-02-04 17:20:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 17:20:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-02-04 17:20:34,862 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2018-02-04 17:20:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:34,862 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-02-04 17:20:34,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:20:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-02-04 17:20:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 17:20:34,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:34,863 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:34,863 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash -485266577, now seen corresponding path program 12 times [2018-02-04 17:20:34,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:34,864 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:34,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:34,864 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:34,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:34,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:34,983 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:34,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:34,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:34,984 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:20:35,101 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:20:35,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:35,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:35,128 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-02-04 17:20:35,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,133 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-02-04 17:20:35,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:35,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:35,150 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-02-04 17:20:35,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:35,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:35,159 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-02-04 17:20:35,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:35,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:35,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:35,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:20:35,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:20:35,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:20:35,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:20:35,693 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 25 states. [2018-02-04 17:20:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:36,644 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-02-04 17:20:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:20:36,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-02-04 17:20:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:36,644 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:20:36,645 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:20:36,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=2097, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:20:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:20:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-02-04 17:20:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 17:20:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-02-04 17:20:36,647 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 80 [2018-02-04 17:20:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:36,647 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-02-04 17:20:36,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:20:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-02-04 17:20:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 17:20:36,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:36,647 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:36,647 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1648961835, now seen corresponding path program 13 times [2018-02-04 17:20:36,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:36,648 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:36,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:36,648 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:36,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:36,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:36,734 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:36,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:36,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:36,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:36,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:36,809 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-02-04 17:20:36,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,821 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-02-04 17:20:36,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:36,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:36,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:36,840 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-02-04 17:20:36,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,847 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-02-04 17:20:36,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:36,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:37,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:37,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:20:37,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:20:37,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:20:37,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:20:37,230 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 25 states. [2018-02-04 17:20:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:38,131 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-02-04 17:20:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:20:38,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2018-02-04 17:20:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:38,132 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:20:38,132 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:20:38,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=2010, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:20:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:20:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-02-04 17:20:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 17:20:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-02-04 17:20:38,133 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 85 [2018-02-04 17:20:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:38,134 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-02-04 17:20:38,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:20:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-02-04 17:20:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 17:20:38,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:38,134 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:38,134 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -521101073, now seen corresponding path program 14 times [2018-02-04 17:20:38,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:38,135 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:38,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:38,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:38,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:38,225 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:38,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:38,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:38,226 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:38,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:38,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:38,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:38,385 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-02-04 17:20:38,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,393 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-02-04 17:20:38,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:38,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:38,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:38,418 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-02-04 17:20:38,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,427 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-02-04 17:20:38,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:38,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:38,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:38,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:20:38,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:20:38,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:20:38,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:20:38,891 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 27 states. [2018-02-04 17:20:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:39,893 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-02-04 17:20:39,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:20:39,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 90 [2018-02-04 17:20:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:39,894 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:20:39,894 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:20:39,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=2481, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:20:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:20:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-02-04 17:20:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 17:20:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-02-04 17:20:39,896 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 90 [2018-02-04 17:20:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:39,896 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-02-04 17:20:39,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:20:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-02-04 17:20:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 17:20:39,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:39,897 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:39,897 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -774806613, now seen corresponding path program 15 times [2018-02-04 17:20:39,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:39,897 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:39,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,898 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:39,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:39,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:39,989 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:39,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:39,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:39,990 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:40,086 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:20:40,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:40,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:40,111 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-02-04 17:20:40,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:20:40,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:20:40,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:40,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:40,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:20:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:40,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:40,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:20:40,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:20:40,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:20:40,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:20:40,502 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 27 states. [2018-02-04 17:20:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:41,403 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-02-04 17:20:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:20:41,403 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 95 [2018-02-04 17:20:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:41,403 INFO L225 Difference]: With dead ends: 102 [2018-02-04 17:20:41,403 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 17:20:41,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=2386, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:20:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 17:20:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-02-04 17:20:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 17:20:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-02-04 17:20:41,405 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 95 [2018-02-04 17:20:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:41,406 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-02-04 17:20:41,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:20:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-02-04 17:20:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 17:20:41,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:41,406 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:41,406 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1175914897, now seen corresponding path program 16 times [2018-02-04 17:20:41,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:41,407 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:41,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:41,407 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:41,407 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:41,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:41,473 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:41,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:41,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:41,474 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:20:41,568 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:20:41,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:41,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:41,626 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-02-04 17:20:41,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,634 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-02-04 17:20:41,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:41,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:41,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:41,659 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-02-04 17:20:41,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,666 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-02-04 17:20:41,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:41,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:42,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:42,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:20:42,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:20:42,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:20:42,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:20:42,092 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 29 states. [2018-02-04 17:20:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:43,286 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 17:20:43,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:20:43,286 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2018-02-04 17:20:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:43,287 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:20:43,287 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:20:43,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=180, Invalid=2790, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:20:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:20:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-02-04 17:20:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 17:20:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-02-04 17:20:43,289 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 100 [2018-02-04 17:20:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:43,289 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-02-04 17:20:43,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:20:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-02-04 17:20:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 17:20:43,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:43,290 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:43,290 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1171096021, now seen corresponding path program 17 times [2018-02-04 17:20:43,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:43,290 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:43,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:43,290 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:43,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:43,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:43,398 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:43,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:43,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:43,399 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:20:43,566 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:20:43,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:43,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:43,592 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-02-04 17:20:43,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,599 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-02-04 17:20:43,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:43,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:43,623 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-02-04 17:20:43,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:43,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:43,634 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-02-04 17:20:43,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:43,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:44,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:44,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:20:44,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:20:44,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:20:44,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:20:44,119 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 29 states. [2018-02-04 17:20:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:45,380 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-02-04 17:20:45,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:20:45,380 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 105 [2018-02-04 17:20:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:45,381 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:20:45,381 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 17:20:45,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=2794, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:20:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 17:20:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-02-04 17:20:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 17:20:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 17:20:45,383 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 105 [2018-02-04 17:20:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:45,383 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 17:20:45,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:20:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 17:20:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 17:20:45,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:45,384 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:45,384 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash 513043439, now seen corresponding path program 18 times [2018-02-04 17:20:45,384 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:45,384 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:45,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:45,385 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:45,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:45,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:45,437 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:45,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:45,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:45,437 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:20:45,664 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:20:45,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:45,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:45,691 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-02-04 17:20:45,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,698 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-02-04 17:20:45,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:45,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:45,721 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-02-04 17:20:45,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:45,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:45,737 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-02-04 17:20:45,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:45,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:46,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:46,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 17:20:46,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:20:46,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:20:46,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:20:46,168 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 30 states. [2018-02-04 17:20:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:47,385 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-02-04 17:20:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:20:47,385 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 110 [2018-02-04 17:20:47,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:47,386 INFO L225 Difference]: With dead ends: 117 [2018-02-04 17:20:47,386 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 17:20:47,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=3010, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:20:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 17:20:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-02-04 17:20:47,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 17:20:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-02-04 17:20:47,388 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 110 [2018-02-04 17:20:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:47,388 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-02-04 17:20:47,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:20:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-02-04 17:20:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-02-04 17:20:47,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:47,389 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:47,389 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 164919467, now seen corresponding path program 19 times [2018-02-04 17:20:47,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:47,389 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:47,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:47,390 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:47,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:47,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:47,577 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:47,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:47,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:47,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:47,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:47,670 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-02-04 17:20:47,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,675 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-02-04 17:20:47,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:47,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:47,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:47,691 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-02-04 17:20:47,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,697 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-02-04 17:20:47,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:47,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:48,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:48,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 17:20:48,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:20:48,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:20:48,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:20:48,221 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 32 states. [2018-02-04 17:20:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:49,547 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-02-04 17:20:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:20:49,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 115 [2018-02-04 17:20:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:49,548 INFO L225 Difference]: With dead ends: 122 [2018-02-04 17:20:49,548 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 17:20:49,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=3581, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:20:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 17:20:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-02-04 17:20:49,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 17:20:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-02-04 17:20:49,551 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 115 [2018-02-04 17:20:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:49,552 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-02-04 17:20:49,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:20:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-02-04 17:20:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-04 17:20:49,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:49,552 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:49,552 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash -510983825, now seen corresponding path program 20 times [2018-02-04 17:20:49,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:49,553 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:49,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:49,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:20:49,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:49,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:49,670 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:49,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:49,670 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:49,671 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:20:49,922 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:20:49,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:49,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:49,950 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-02-04 17:20:49,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,955 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-02-04 17:20:49,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:49,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:49,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:49,972 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-02-04 17:20:49,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,980 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-02-04 17:20:49,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:49,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:50,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:50,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 17:20:50,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:20:50,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:20:50,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:20:50,504 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 33 states. [2018-02-04 17:20:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:52,032 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-02-04 17:20:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:20:52,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-02-04 17:20:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:52,033 INFO L225 Difference]: With dead ends: 127 [2018-02-04 17:20:52,033 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 17:20:52,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=3825, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:20:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 17:20:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-02-04 17:20:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 17:20:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-02-04 17:20:52,035 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 120 [2018-02-04 17:20:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:52,035 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-02-04 17:20:52,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:20:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-02-04 17:20:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-02-04 17:20:52,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:52,036 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:52,036 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:52,036 INFO L82 PathProgramCache]: Analyzing trace with hash -853585109, now seen corresponding path program 21 times [2018-02-04 17:20:52,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:52,036 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:52,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:52,036 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:52,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:52,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:52,091 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:52,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:52,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:52,092 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:20:52,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:20:52,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:52,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:52,291 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-02-04 17:20:52,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:52,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:52,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:20:52,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:20:52,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:20:52,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:52,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:20:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:52,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:52,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 17:20:52,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:20:52,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:20:52,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:20:52,750 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 33 states. [2018-02-04 17:20:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:54,077 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-02-04 17:20:54,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:20:54,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 125 [2018-02-04 17:20:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:54,078 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:20:54,078 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:20:54,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=3706, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:20:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:20:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-02-04 17:20:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 17:20:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-02-04 17:20:54,080 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 125 [2018-02-04 17:20:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:54,080 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-02-04 17:20:54,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:20:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-02-04 17:20:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-02-04 17:20:54,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:54,081 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:54,081 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2003089135, now seen corresponding path program 22 times [2018-02-04 17:20:54,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:54,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:54,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:54,082 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:54,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:54,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:54,185 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:54,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:54,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:54,185 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:20:54,288 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:20:54,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:54,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:54,321 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-02-04 17:20:54,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,326 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-02-04 17:20:54,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:54,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:54,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:54,339 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-02-04 17:20:54,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,344 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-02-04 17:20:54,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:54,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:20:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:54,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:54,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 17:20:54,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:20:54,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:20:54,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:20:54,877 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 35 states. [2018-02-04 17:20:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:56,555 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-02-04 17:20:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:20:56,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 130 [2018-02-04 17:20:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:56,556 INFO L225 Difference]: With dead ends: 137 [2018-02-04 17:20:56,556 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 17:20:56,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=4337, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 17:20:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 17:20:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-02-04 17:20:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 17:20:56,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-02-04 17:20:56,559 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 130 [2018-02-04 17:20:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:56,559 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-02-04 17:20:56,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:20:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-02-04 17:20:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-04 17:20:56,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:56,560 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:56,560 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1367667285, now seen corresponding path program 23 times [2018-02-04 17:20:56,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:56,560 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:56,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:56,560 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:56,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:56,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:56,637 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:56,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:56,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:56,638 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:20:56,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:20:56,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:56,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:56,987 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-02-04 17:20:56,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:56,998 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-02-04 17:20:56,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:57,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:57,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:57,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:57,020 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-02-04 17:20:57,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:57,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:57,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:57,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:20:57,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:57,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:57,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:20:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:20:57,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:20:57,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:20:57,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:20:57,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:20:57,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:20:57,624 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 34 states. [2018-02-04 17:20:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:20:59,137 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-02-04 17:20:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:20:59,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 135 [2018-02-04 17:20:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:20:59,138 INFO L225 Difference]: With dead ends: 142 [2018-02-04 17:20:59,138 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 17:20:59,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=199, Invalid=3833, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:20:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 17:20:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-02-04 17:20:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 17:20:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-02-04 17:20:59,140 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 135 [2018-02-04 17:20:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:20:59,140 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-02-04 17:20:59,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:20:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-02-04 17:20:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-04 17:20:59,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:20:59,140 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:20:59,140 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:20:59,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1991871599, now seen corresponding path program 24 times [2018-02-04 17:20:59,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:20:59,141 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:20:59,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:59,141 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:20:59,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:20:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:20:59,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:20:59,178 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:20:59,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:20:59,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:20:59,179 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:20:59,500 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:20:59,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:20:59,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:20:59,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:20:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,562 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-02-04 17:20:59,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:20:59,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:59,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:20:59,586 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-02-04 17:20:59,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,595 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-02-04 17:20:59,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:20:59,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:00,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:00,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 17:21:00,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 17:21:00,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 17:21:00,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 17:21:00,210 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 36 states. [2018-02-04 17:21:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:01,985 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-04 17:21:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:21:01,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-02-04 17:21:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:01,986 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:21:01,986 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:21:01,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=4474, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:21:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:21:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-02-04 17:21:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 17:21:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-02-04 17:21:01,989 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 140 [2018-02-04 17:21:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:01,990 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-02-04 17:21:01,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 17:21:01,990 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-02-04 17:21:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 17:21:01,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:01,991 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:01,991 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1984931883, now seen corresponding path program 25 times [2018-02-04 17:21:01,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:01,991 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:01,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:01,992 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:01,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:02,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:02,160 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:02,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:02,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:02,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:02,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:02,325 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-02-04 17:21:02,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,330 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-02-04 17:21:02,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:02,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:02,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:02,345 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-02-04 17:21:02,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,352 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-02-04 17:21:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:02,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:21:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:03,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:03,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 17:21:03,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:21:03,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:21:03,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:21:03,117 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 38 states. [2018-02-04 17:21:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:05,120 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-02-04 17:21:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:21:05,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-02-04 17:21:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:05,121 INFO L225 Difference]: With dead ends: 152 [2018-02-04 17:21:05,121 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 17:21:05,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=5165, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:21:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 17:21:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-02-04 17:21:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 17:21:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-04 17:21:05,124 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 145 [2018-02-04 17:21:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:05,125 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-04 17:21:05,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:21:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-04 17:21:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-04 17:21:05,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:05,126 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:05,126 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash 404849135, now seen corresponding path program 26 times [2018-02-04 17:21:05,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:05,126 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:05,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:05,127 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:05,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:05,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:05,225 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:05,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:05,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:05,226 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:21:05,685 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:21:05,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:05,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:05,735 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-02-04 17:21:05,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,740 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-02-04 17:21:05,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:05,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:05,754 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-02-04 17:21:05,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:05,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:05,767 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-02-04 17:21:05,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:05,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:21:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:06,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:06,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:21:06,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:21:06,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:21:06,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:21:06,450 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 39 states. [2018-02-04 17:21:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:08,487 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-02-04 17:21:08,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:21:08,488 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-02-04 17:21:08,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:08,488 INFO L225 Difference]: With dead ends: 157 [2018-02-04 17:21:08,488 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 17:21:08,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=5457, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 17:21:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 17:21:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-02-04 17:21:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 17:21:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-02-04 17:21:08,490 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 150 [2018-02-04 17:21:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:08,491 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-02-04 17:21:08,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:21:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-02-04 17:21:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-04 17:21:08,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:08,491 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:08,491 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1962597717, now seen corresponding path program 27 times [2018-02-04 17:21:08,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:08,491 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:08,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:08,492 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:08,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:08,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:08,721 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:08,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:08,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:08,722 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:21:09,000 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:21:09,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:09,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:09,042 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-02-04 17:21:09,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,050 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-02-04 17:21:09,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:09,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:09,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:09,064 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-02-04 17:21:09,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,069 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-02-04 17:21:09,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:09,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:09,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:09,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:21:09,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:21:09,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:21:09,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:21:09,754 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 39 states. [2018-02-04 17:21:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:11,791 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-02-04 17:21:11,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:21:11,791 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 155 [2018-02-04 17:21:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:11,792 INFO L225 Difference]: With dead ends: 162 [2018-02-04 17:21:11,792 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 17:21:11,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=236, Invalid=5314, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 17:21:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 17:21:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-02-04 17:21:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 17:21:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-02-04 17:21:11,794 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 155 [2018-02-04 17:21:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:11,794 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-02-04 17:21:11,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:21:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-02-04 17:21:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-04 17:21:11,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:11,795 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:11,795 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1238067345, now seen corresponding path program 28 times [2018-02-04 17:21:11,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:11,795 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:11,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:11,796 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:11,796 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:11,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:11,960 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:11,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:11,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:11,961 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:21:12,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:21:12,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:12,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:12,251 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-02-04 17:21:12,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,255 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-02-04 17:21:12,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:12,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:12,269 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-02-04 17:21:12,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:12,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:12,275 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-02-04 17:21:12,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:12,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:13,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:13,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 17:21:13,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 17:21:13,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 17:21:13,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:21:13,010 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 40 states. [2018-02-04 17:21:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:15,161 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-02-04 17:21:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:21:15,162 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 160 [2018-02-04 17:21:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:15,162 INFO L225 Difference]: With dead ends: 167 [2018-02-04 17:21:15,162 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 17:21:15,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=242, Invalid=5610, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:21:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 17:21:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-02-04 17:21:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-04 17:21:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-02-04 17:21:15,165 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 160 [2018-02-04 17:21:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:15,165 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-02-04 17:21:15,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 17:21:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-02-04 17:21:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-04 17:21:15,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:15,165 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:15,165 INFO L371 AbstractCegarLoop]: === Iteration 43 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1896054059, now seen corresponding path program 29 times [2018-02-04 17:21:15,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:15,166 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:15,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:15,166 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:15,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:15,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:15,469 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:15,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:15,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:15,469 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:21:15,824 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:21:15,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:15,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:15,869 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-02-04 17:21:15,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,877 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-02-04 17:21:15,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:15,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:15,892 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-02-04 17:21:15,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:15,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:15,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:21:15,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:15,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:16,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:16,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-04 17:21:16,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 17:21:16,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 17:21:16,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:21:16,625 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 40 states. [2018-02-04 17:21:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:18,728 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-02-04 17:21:18,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:21:18,729 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 165 [2018-02-04 17:21:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:18,729 INFO L225 Difference]: With dead ends: 172 [2018-02-04 17:21:18,729 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 17:21:18,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=5465, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 17:21:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 17:21:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-02-04 17:21:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 17:21:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-02-04 17:21:18,733 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 165 [2018-02-04 17:21:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:18,733 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-02-04 17:21:18,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 17:21:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-02-04 17:21:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-02-04 17:21:18,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:18,735 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:18,735 INFO L371 AbstractCegarLoop]: === Iteration 44 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1300942063, now seen corresponding path program 30 times [2018-02-04 17:21:18,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:18,735 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:18,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:18,736 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:18,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:18,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:19,047 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:19,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:19,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:19,047 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:21:19,790 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:21:19,791 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:19,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:19,864 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-02-04 17:21:19,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,873 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-02-04 17:21:19,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:19,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:19,888 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-02-04 17:21:19,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,894 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:19,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:19,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:21:19,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:19,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:20,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-02-04 17:21:20,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:20,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:21:20,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2018-02-04 17:21:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:20,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:20,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 17:21:20,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:21:20,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:21:20,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:21:20,909 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 44 states. [2018-02-04 17:21:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:23,744 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-02-04 17:21:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:21:23,744 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-02-04 17:21:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:23,744 INFO L225 Difference]: With dead ends: 177 [2018-02-04 17:21:23,744 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 17:21:23,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=282, Invalid=7028, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:21:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 17:21:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-02-04 17:21:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 17:21:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-02-04 17:21:23,747 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 170 [2018-02-04 17:21:23,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:23,747 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-02-04 17:21:23,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:21:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-02-04 17:21:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-02-04 17:21:23,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:23,748 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:23,748 INFO L371 AbstractCegarLoop]: === Iteration 45 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:23,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1253226411, now seen corresponding path program 31 times [2018-02-04 17:21:23,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:23,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:23,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:23,749 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:23,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:23,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:23,999 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:24,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:24,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:24,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:24,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:24,268 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-02-04 17:21:24,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,273 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-02-04 17:21:24,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:24,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:24,297 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-02-04 17:21:24,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:24,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:24,305 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-02-04 17:21:24,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:24,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:21:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:25,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:25,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 17:21:25,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:21:25,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:21:25,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:21:25,230 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 44 states. [2018-02-04 17:21:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:27,796 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-02-04 17:21:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:21:27,797 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-02-04 17:21:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:27,798 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:21:27,798 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 17:21:27,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=273, Invalid=7037, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:21:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 17:21:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-02-04 17:21:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 17:21:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-02-04 17:21:27,800 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 175 [2018-02-04 17:21:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:27,800 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-02-04 17:21:27,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:21:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-02-04 17:21:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 17:21:27,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:27,800 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:27,801 INFO L371 AbstractCegarLoop]: === Iteration 46 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash -54779281, now seen corresponding path program 32 times [2018-02-04 17:21:27,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:27,801 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:27,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:27,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:27,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:27,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:28,184 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:28,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:28,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:28,185 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:21:28,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:21:28,823 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:28,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:28,876 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-02-04 17:21:28,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,881 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-02-04 17:21:28,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:28,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:28,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:28,899 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-02-04 17:21:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,904 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-02-04 17:21:28,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:28,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:21:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:29,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:29,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 17:21:29,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:21:29,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:21:29,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:21:29,892 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 45 states. [2018-02-04 17:21:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:32,639 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 17:21:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:21:32,639 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 180 [2018-02-04 17:21:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:32,639 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:21:32,639 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:21:32,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=7377, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 17:21:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:21:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-02-04 17:21:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 17:21:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-02-04 17:21:32,641 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 180 [2018-02-04 17:21:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:32,642 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-02-04 17:21:32,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:21:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-02-04 17:21:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-02-04 17:21:32,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:32,642 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:32,642 INFO L371 AbstractCegarLoop]: === Iteration 47 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1484444203, now seen corresponding path program 33 times [2018-02-04 17:21:32,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:32,643 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:32,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:32,643 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:32,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:32,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:33,184 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:33,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:33,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:33,184 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:21:33,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:21:33,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:33,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:33,604 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-02-04 17:21:33,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:33,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:33,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:21:33,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:21:33,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:21:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:33,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:21:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:34,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:34,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 17:21:34,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:21:34,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:21:34,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:21:34,495 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 45 states. [2018-02-04 17:21:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:37,178 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-02-04 17:21:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:21:37,179 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 185 [2018-02-04 17:21:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:37,179 INFO L225 Difference]: With dead ends: 192 [2018-02-04 17:21:37,179 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 17:21:37,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=272, Invalid=7210, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 17:21:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 17:21:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-02-04 17:21:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 17:21:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-02-04 17:21:37,181 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 185 [2018-02-04 17:21:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:37,182 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-02-04 17:21:37,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:21:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-02-04 17:21:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-02-04 17:21:37,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:37,182 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:37,182 INFO L371 AbstractCegarLoop]: === Iteration 48 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:37,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2074044433, now seen corresponding path program 34 times [2018-02-04 17:21:37,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:37,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:37,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:37,183 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:37,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:37,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:37,261 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:37,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:37,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:37,261 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:21:37,693 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:21:37,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:37,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:37,753 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-02-04 17:21:37,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,757 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-02-04 17:21:37,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:37,770 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-02-04 17:21:37,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,775 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-02-04 17:21:37,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:37,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:21:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:38,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:38,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 17:21:38,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:21:38,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:21:38,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:21:38,823 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 47 states. [2018-02-04 17:21:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:41,736 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-02-04 17:21:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:21:41,736 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 190 [2018-02-04 17:21:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:41,737 INFO L225 Difference]: With dead ends: 197 [2018-02-04 17:21:41,737 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 17:21:41,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=291, Invalid=8081, Unknown=0, NotChecked=0, Total=8372 [2018-02-04 17:21:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 17:21:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-02-04 17:21:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 17:21:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-02-04 17:21:41,739 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 190 [2018-02-04 17:21:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:41,739 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-02-04 17:21:41,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:21:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-02-04 17:21:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-04 17:21:41,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:41,740 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:41,740 INFO L371 AbstractCegarLoop]: === Iteration 49 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2026097835, now seen corresponding path program 35 times [2018-02-04 17:21:41,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:41,740 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:41,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:41,741 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:41,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:41,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:42,202 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:42,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:42,202 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:42,203 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:21:42,855 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:21:42,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:42,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:42,892 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-02-04 17:21:42,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:42,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:42,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:21:42,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:21:42,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:21:42,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:42,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:21:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:43,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:43,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 17:21:43,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:21:43,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:21:43,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:21:43,778 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 47 states. [2018-02-04 17:21:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:46,372 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-02-04 17:21:46,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:21:46,372 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 195 [2018-02-04 17:21:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:46,373 INFO L225 Difference]: With dead ends: 202 [2018-02-04 17:21:46,373 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 17:21:46,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=284, Invalid=7906, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 17:21:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 17:21:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-02-04 17:21:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 17:21:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-02-04 17:21:46,376 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 195 [2018-02-04 17:21:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:46,376 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-02-04 17:21:46,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:21:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-02-04 17:21:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-02-04 17:21:46,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:46,377 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:46,377 INFO L371 AbstractCegarLoop]: === Iteration 50 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash -955241105, now seen corresponding path program 36 times [2018-02-04 17:21:46,377 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:46,377 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:46,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:46,377 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:46,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:46,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:46,921 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:46,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:46,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:46,922 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:21:47,503 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:21:47,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:21:47,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:47,585 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-02-04 17:21:47,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,589 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-02-04 17:21:47,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:47,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:47,611 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-02-04 17:21:47,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:47,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:47,619 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-02-04 17:21:47,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:47,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:48,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:21:48,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:48,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:21:48,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2018-02-04 17:21:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:48,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:48,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 17:21:48,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:21:48,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:21:48,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:21:48,801 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 49 states. [2018-02-04 17:21:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:52,290 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-02-04 17:21:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:21:52,291 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 200 [2018-02-04 17:21:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:52,291 INFO L225 Difference]: With dead ends: 207 [2018-02-04 17:21:52,291 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 17:21:52,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=305, Invalid=8625, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 17:21:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 17:21:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-02-04 17:21:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 17:21:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-02-04 17:21:52,294 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 200 [2018-02-04 17:21:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:52,294 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-02-04 17:21:52,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:21:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-02-04 17:21:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-02-04 17:21:52,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:52,294 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:52,295 INFO L371 AbstractCegarLoop]: === Iteration 51 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1477073109, now seen corresponding path program 37 times [2018-02-04 17:21:52,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:52,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:52,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:52,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:21:52,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:52,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:52,381 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:52,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:52,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:52,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:53,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:21:53,096 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-02-04 17:21:53,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,109 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-02-04 17:21:53,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:21:53,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:53,126 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-02-04 17:21:53,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:53,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:21:53,135 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-02-04 17:21:53,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:21:53,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-02-04 17:21:53,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:21:53,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-02-04 17:21:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:21:54,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:21:54,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 17:21:54,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:21:54,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:21:54,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:21:54,463 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 53 states. [2018-02-04 17:21:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:21:58,425 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-02-04 17:21:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:21:58,425 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 205 [2018-02-04 17:21:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:21:58,425 INFO L225 Difference]: With dead ends: 212 [2018-02-04 17:21:58,425 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 17:21:58,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=341, Invalid=10579, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 17:21:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 17:21:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-02-04 17:21:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 17:21:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-02-04 17:21:58,428 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 205 [2018-02-04 17:21:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:21:58,428 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-02-04 17:21:58,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:21:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-02-04 17:21:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-02-04 17:21:58,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:21:58,428 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:21:58,428 INFO L371 AbstractCegarLoop]: === Iteration 52 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:21:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1231217391, now seen corresponding path program 38 times [2018-02-04 17:21:58,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:21:58,429 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:21:58,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:58,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:21:58,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:21:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:21:58,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:21:58,853 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:21:58,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:21:58,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:21:58,854 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:22:00,069 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:22:00,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:00,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:00,137 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-02-04 17:22:00,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,150 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-02-04 17:22:00,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:00,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:00,165 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-02-04 17:22:00,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:00,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:00,172 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-02-04 17:22:00,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:00,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:22:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:01,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:01,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 17:22:01,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 17:22:01,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 17:22:01,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:22:01,303 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 51 states. [2018-02-04 17:22:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:05,333 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-02-04 17:22:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:22:05,334 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 210 [2018-02-04 17:22:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:05,334 INFO L225 Difference]: With dead ends: 217 [2018-02-04 17:22:05,334 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:22:05,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=315, Invalid=9585, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:22:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:22:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-04 17:22:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:22:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-02-04 17:22:05,337 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 210 [2018-02-04 17:22:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:05,337 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-02-04 17:22:05,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 17:22:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-02-04 17:22:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-02-04 17:22:05,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:05,338 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:05,338 INFO L371 AbstractCegarLoop]: === Iteration 53 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2139594325, now seen corresponding path program 39 times [2018-02-04 17:22:05,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:05,338 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:05,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:05,339 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:05,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:05,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:05,724 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:05,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:05,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:05,725 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:22:06,341 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:22:06,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:06,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:06,479 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-02-04 17:22:06,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:06,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:06,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:22:06,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:22:06,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:22:06,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:06,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:22:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:07,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:07,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-02-04 17:22:07,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 17:22:07,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 17:22:07,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 17:22:07,517 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 51 states. [2018-02-04 17:22:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:10,795 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-02-04 17:22:10,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:22:10,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-02-04 17:22:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:10,796 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:22:10,796 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:22:10,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=308, Invalid=9394, Unknown=0, NotChecked=0, Total=9702 [2018-02-04 17:22:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:22:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-02-04 17:22:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-04 17:22:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-02-04 17:22:10,800 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 215 [2018-02-04 17:22:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:10,800 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-02-04 17:22:10,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 17:22:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-02-04 17:22:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-02-04 17:22:10,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:10,801 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:10,801 INFO L371 AbstractCegarLoop]: === Iteration 54 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1309624209, now seen corresponding path program 40 times [2018-02-04 17:22:10,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:10,802 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:10,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:10,802 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:10,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:10,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:10,979 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:10,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:10,979 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:10,980 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:22:11,498 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:22:11,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:11,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:11,633 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-02-04 17:22:11,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,637 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-02-04 17:22:11,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:11,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:11,651 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-02-04 17:22:11,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:11,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:11,657 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-02-04 17:22:11,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:11,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:22:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:12,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:12,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 17:22:12,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:22:12,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:22:12,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:22:12,864 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 53 states. [2018-02-04 17:22:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:16,696 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 17:22:16,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:22:16,696 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 220 [2018-02-04 17:22:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:16,697 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:22:16,697 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:22:16,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=327, Invalid=10385, Unknown=0, NotChecked=0, Total=10712 [2018-02-04 17:22:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:22:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-02-04 17:22:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 17:22:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-02-04 17:22:16,699 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 220 [2018-02-04 17:22:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:16,700 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-02-04 17:22:16,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:22:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-02-04 17:22:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-04 17:22:16,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:16,700 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:16,700 INFO L371 AbstractCegarLoop]: === Iteration 55 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1162609621, now seen corresponding path program 41 times [2018-02-04 17:22:16,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:16,701 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:16,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:16,701 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:16,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:16,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:17,319 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:17,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:17,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:17,450 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:22:18,206 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:22:18,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:18,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:18,267 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-02-04 17:22:18,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,272 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-02-04 17:22:18,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:18,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:18,285 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-02-04 17:22:18,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:18,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:18,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:22:18,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:18,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:22:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:19,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:19,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 17:22:19,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:22:19,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:22:19,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:22:19,481 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 53 states. [2018-02-04 17:22:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:23,007 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2018-02-04 17:22:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:22:23,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 225 [2018-02-04 17:22:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:23,008 INFO L225 Difference]: With dead ends: 232 [2018-02-04 17:22:23,008 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 17:22:23,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=320, Invalid=10186, Unknown=0, NotChecked=0, Total=10506 [2018-02-04 17:22:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 17:22:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-02-04 17:22:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:22:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-02-04 17:22:23,011 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 225 [2018-02-04 17:22:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:23,011 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-02-04 17:22:23,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:22:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-02-04 17:22:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-02-04 17:22:23,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:23,012 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:23,012 INFO L371 AbstractCegarLoop]: === Iteration 56 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1230089711, now seen corresponding path program 42 times [2018-02-04 17:22:23,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:23,012 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:23,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:23,012 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:23,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:23,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:23,479 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:23,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:23,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:23,479 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:22:24,481 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:22:24,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:24,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:24,606 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-02-04 17:22:24,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,621 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-02-04 17:22:24,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:24,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:24,634 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-02-04 17:22:24,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:24,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:24,649 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-02-04 17:22:24,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:24,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:22:25,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-04 17:22:25,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:25,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:22:25,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-02-04 17:22:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:26,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:26,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 17:22:26,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:22:26,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:22:26,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:22:26,148 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 56 states. [2018-02-04 17:22:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:30,631 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-02-04 17:22:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:22:30,631 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 230 [2018-02-04 17:22:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:30,632 INFO L225 Difference]: With dead ends: 237 [2018-02-04 17:22:30,632 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 17:22:30,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=350, Invalid=11422, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:22:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 17:22:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-02-04 17:22:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-04 17:22:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-02-04 17:22:30,634 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 230 [2018-02-04 17:22:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:30,634 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-02-04 17:22:30,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:22:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-02-04 17:22:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-02-04 17:22:30,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:30,635 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:30,635 INFO L371 AbstractCegarLoop]: === Iteration 57 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1391429973, now seen corresponding path program 43 times [2018-02-04 17:22:30,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:30,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:30,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:30,636 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:30,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:30,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:31,372 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:31,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:31,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:31,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:22:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:32,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:32,181 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-02-04 17:22:32,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,185 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-02-04 17:22:32,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:32,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:32,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:32,197 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-02-04 17:22:32,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,202 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-02-04 17:22:32,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:32,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:22:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:33,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:33,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 17:22:33,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:22:33,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:22:33,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:22:33,792 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 56 states. [2018-02-04 17:22:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:38,181 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-02-04 17:22:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:22:38,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 235 [2018-02-04 17:22:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:38,182 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:22:38,182 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:22:38,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=345, Invalid=11645, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 17:22:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:22:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-02-04 17:22:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-04 17:22:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-02-04 17:22:38,185 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 235 [2018-02-04 17:22:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:38,185 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-02-04 17:22:38,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:22:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-02-04 17:22:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-02-04 17:22:38,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:38,186 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:38,186 INFO L371 AbstractCegarLoop]: === Iteration 58 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2048770927, now seen corresponding path program 44 times [2018-02-04 17:22:38,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:38,187 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:38,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:38,187 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:22:38,187 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:38,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:38,612 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:38,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:38,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:38,613 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:22:39,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:22:39,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:39,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:39,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:22:39,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,938 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-02-04 17:22:39,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:39,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:39,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:39,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 17:22:39,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,959 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-02-04 17:22:39,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:39,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-02-04 17:22:40,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-02-04 17:22:40,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:40,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:40,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-02-04 17:22:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:41,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:41,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 17:22:41,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:22:41,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:22:41,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:22:41,700 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 59 states. [2018-02-04 17:22:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:46,875 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-02-04 17:22:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:22:46,875 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 240 [2018-02-04 17:22:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:46,876 INFO L225 Difference]: With dead ends: 247 [2018-02-04 17:22:46,876 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 17:22:46,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=369, Invalid=12971, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:22:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 17:22:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-02-04 17:22:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 17:22:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-02-04 17:22:46,878 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 240 [2018-02-04 17:22:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:46,878 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-02-04 17:22:46,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:22:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-02-04 17:22:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-02-04 17:22:46,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:46,879 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:46,879 INFO L371 AbstractCegarLoop]: === Iteration 59 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:46,879 INFO L82 PathProgramCache]: Analyzing trace with hash -873082581, now seen corresponding path program 45 times [2018-02-04 17:22:46,879 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:46,879 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:46,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:46,880 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:46,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:46,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:47,298 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:47,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:47,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:47,298 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:22:48,155 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:22:48,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:48,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:48,350 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-02-04 17:22:48,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:48,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:48,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:22:48,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:22:48,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:22:48,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:48,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:22:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:49,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:49,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 17:22:49,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:22:49,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:22:49,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:22:49,637 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 57 states. [2018-02-04 17:22:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:22:53,825 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-02-04 17:22:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:22:53,826 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 245 [2018-02-04 17:22:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:22:53,826 INFO L225 Difference]: With dead ends: 252 [2018-02-04 17:22:53,826 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 17:22:53,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=344, Invalid=11866, Unknown=0, NotChecked=0, Total=12210 [2018-02-04 17:22:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 17:22:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-02-04 17:22:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 17:22:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-02-04 17:22:53,829 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 245 [2018-02-04 17:22:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:22:53,829 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-02-04 17:22:53,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:22:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-02-04 17:22:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-02-04 17:22:53,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:22:53,830 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:22:53,830 INFO L371 AbstractCegarLoop]: === Iteration 60 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:22:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1357707503, now seen corresponding path program 46 times [2018-02-04 17:22:53,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:22:53,830 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:22:53,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:53,830 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:22:53,830 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:22:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:22:53,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:22:54,159 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:22:54,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:22:54,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:22:54,159 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:22:54,871 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:22:54,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:22:54,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:22:54,977 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-02-04 17:22:54,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:54,980 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-02-04 17:22:54,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:54,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:54,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:22:54,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:55,001 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-02-04 17:22:55,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:55,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:55,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:22:55,008 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-02-04 17:22:55,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:22:55,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:22:55,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:22:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:22:56,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:22:56,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 17:22:56,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:22:56,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:22:56,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:22:56,447 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 58 states. [2018-02-04 17:23:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:23:01,103 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-02-04 17:23:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:23:01,103 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 250 [2018-02-04 17:23:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:23:01,104 INFO L225 Difference]: With dead ends: 257 [2018-02-04 17:23:01,104 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 17:23:01,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=350, Invalid=12306, Unknown=0, NotChecked=0, Total=12656 [2018-02-04 17:23:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 17:23:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2018-02-04 17:23:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 17:23:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-02-04 17:23:01,106 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 250 [2018-02-04 17:23:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:23:01,106 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-02-04 17:23:01,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:23:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-02-04 17:23:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-04 17:23:01,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:23:01,107 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:23:01,107 INFO L371 AbstractCegarLoop]: === Iteration 61 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:23:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash 701238187, now seen corresponding path program 47 times [2018-02-04 17:23:01,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:23:01,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:23:01,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:23:01,108 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:23:01,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:23:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:23:01,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:23:02,007 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:23:02,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:23:02,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:23:02,007 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:23:04,862 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:23:04,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:23:04,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:23:04,926 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-02-04 17:23:04,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,930 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-02-04 17:23:04,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:23:04,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:23:04,944 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-02-04 17:23:04,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:23:04,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:23:04,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 17:23:04,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:23:04,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-04 17:23:05,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-02-04 17:23:05,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:05,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:23:05,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-02-04 17:23:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:23:06,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:23:06,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 17:23:06,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:23:06,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:23:06,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3421, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:23:06,573 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 60 states. [2018-02-04 17:23:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:23:11,689 INFO L93 Difference]: Finished difference Result 262 states and 263 transitions. [2018-02-04 17:23:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:23:11,689 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 255 [2018-02-04 17:23:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:23:11,690 INFO L225 Difference]: With dead ends: 262 [2018-02-04 17:23:11,690 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:23:11,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=361, Invalid=12979, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 17:23:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:23:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-02-04 17:23:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-04 17:23:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-02-04 17:23:11,692 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 255 [2018-02-04 17:23:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:23:11,692 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-02-04 17:23:11,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:23:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-02-04 17:23:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-02-04 17:23:11,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:23:11,693 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:23:11,693 INFO L371 AbstractCegarLoop]: === Iteration 62 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:23:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -61387153, now seen corresponding path program 48 times [2018-02-04 17:23:11,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:23:11,693 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:23:11,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:23:11,694 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:23:11,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:23:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:23:11,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:23:12,127 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:23:12,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:23:12,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:23:12,127 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:23:13,292 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:23:13,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:23:13,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:23:13,420 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-02-04 17:23:13,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:23:13,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:23:13,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:23:13,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-02-04 17:23:13,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:23:13,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:23:13,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:23:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:23:14,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:23:14,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-02-04 17:23:14,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:23:14,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:23:14,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:23:14,883 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 60 states. Received shutdown request... [2018-02-04 17:23:17,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:23:17,504 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:23:17,507 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:23:17,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:23:17 BoogieIcfgContainer [2018-02-04 17:23:17,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:23:17,507 INFO L168 Benchmark]: Toolchain (without parser) took 177638.55 ms. Allocated memory was 405.3 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 363.3 MB in the beginning and 1.2 GB in the end (delta: -842.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-04 17:23:17,508 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:23:17,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.18 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 352.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:23:17,508 INFO L168 Benchmark]: Boogie Preprocessor took 21.83 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 350.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:23:17,509 INFO L168 Benchmark]: RCFGBuilder took 160.62 ms. Allocated memory is still 405.3 MB. Free memory was 350.1 MB in the beginning and 332.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:23:17,509 INFO L168 Benchmark]: TraceAbstraction took 177290.87 ms. Allocated memory was 405.3 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 331.5 MB in the beginning and 1.2 GB in the end (delta: -874.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-04 17:23:17,510 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 368.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.18 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 352.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.83 ms. Allocated memory is still 405.3 MB. Free memory was 352.7 MB in the beginning and 350.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.62 ms. Allocated memory is still 405.3 MB. Free memory was 350.1 MB in the beginning and 332.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 177290.87 ms. Allocated memory was 405.3 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 331.5 MB in the beginning and 1.2 GB in the end (delta: -874.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (261states) and interpolant automaton (currently 36 states, 60 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. TIMEOUT Result, 177.2s OverallTime, 62 OverallIterations, 49 TraceHistogramMax, 103.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3318 SDtfs, 6420 SDslu, 110446 SDs, 0 SdLazy, 168135 SolverSat, 1491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8703 GetRequests, 5215 SyntacticMatches, 1 SemanticMatches, 3486 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31777 ImplicationChecksByTransitivity, 75.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=61, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 61 MinimizatonAttempts, 105 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 21.2s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 14144 NumberOfCodeBlocks, 14136 NumberOfCodeBlocksAsserted, 745 NumberOfCheckSat, 7088 ConstructedInterpolants, 75 QuantifiedInterpolants, 20935063 SizeOfPredicates, 5506 NumberOfNonLiveVariables, 40549 ConjunctsInSsa, 16986 ConjunctsInUnsatCore, 63 InterpolantComputations, 11 PerfectInterpolantSequences, 5/96868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-23-17-516.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-23-17-516.csv Completed graceful shutdown