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/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:29:42,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:29:42,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:29:42,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:29:42,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:29:42,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:29:42,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:29:42,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:29:42,576 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:29:42,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:29:42,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:29:42,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:29:42,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:29:42,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:29:42,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:29:42,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:29:42,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:29:42,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:29:42,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:29:42,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:29:42,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:29:42,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:29:42,589 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:29:42,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:29:42,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:29:42,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:29:42,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:29:42,592 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:29:42,592 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:29:42,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:29:42,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:29:42,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:29:42,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:29:42,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:29:42,604 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:29:42,604 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:29:42,604 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:29:42,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:29:42,605 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:29:42,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:29:42,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:29:42,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:29:42,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:29:42,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:29:42,607 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:29:42,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:29:42,644 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:29:42,647 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:29:42,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:29:42,649 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:29:42,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:29:42,793 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:29:42,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:29:42,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:29:42,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:29:42,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:29:42,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42, skipping insertion in model container [2018-02-04 17:29:42,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,812 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:29:42,847 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:29:42,935 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:29:42,948 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:29:42,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42 WrapperNode [2018-02-04 17:29:42,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:29:42,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:29:42,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:29:42,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:29:42,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (1/1) ... [2018-02-04 17:29:42,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:29:42,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:29:42,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:29:42,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:29:42,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (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:29:43,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:29:43,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:29:43,020 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-04 17:29:43,020 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:29:43,020 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:29:43,021 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-04 17:29:43,021 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:29:43,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:29:43,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:29:43,158 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:29:43,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:29:43 BoogieIcfgContainer [2018-02-04 17:29:43,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:29:43,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:29:43,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:29:43,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:29:43,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:29:42" (1/3) ... [2018-02-04 17:29:43,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:29:43, skipping insertion in model container [2018-02-04 17:29:43,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:29:42" (2/3) ... [2018-02-04 17:29:43,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:29:43, skipping insertion in model container [2018-02-04 17:29:43,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:29:43" (3/3) ... [2018-02-04 17:29:43,164 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:29:43,172 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:29:43,176 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 17:29:43,212 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:29:43,212 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:29:43,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:29:43,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:29:43,212 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:29:43,212 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:29:43,212 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:29:43,212 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:29:43,213 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:29:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 17:29:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:29:43,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:43,232 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:43,233 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-04 17:29:43,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:43,237 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:43,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,268 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:43,268 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:43,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:43,378 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:29:43,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:43,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:29:43,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:29:43,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:29:43,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:29:43,392 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 17:29:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:43,449 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 17:29:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:29:43,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:29:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:43,457 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:29:43,457 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:29:43,459 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:29:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:29:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 17:29:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:29:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 17:29:43,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-04 17:29:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:43,555 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 17:29:43,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:29:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 17:29:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:29:43,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:43,555 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:43,555 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-04 17:29:43,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:43,556 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:43,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:43,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:43,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:29:43,580 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:29:43,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:43,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:29:43,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:29:43,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:29:43,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:29:43,582 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-04 17:29:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:43,643 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 17:29:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:29:43,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 17:29:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:43,645 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:29:43,645 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:29:43,645 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:29:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:29:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 17:29:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 17:29:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 17:29:43,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 17:29:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:43,649 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 17:29:43,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:29:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 17:29:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:29:43,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:43,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:43,650 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-04 17:29:43,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:43,653 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:43,653 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:43,654 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:43,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:43,716 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:29:43,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:43,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:29:43,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:29:43,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:29:43,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:29:43,717 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 17:29:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:43,771 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 17:29:43,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:29:43,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 17:29:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:43,772 INFO L225 Difference]: With dead ends: 36 [2018-02-04 17:29:43,772 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:29:43,773 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:29:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:29:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:29:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:29:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:29:43,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 17:29:43,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:43,776 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:29:43,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:29:43,777 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:29:43,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:29:43,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:43,777 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:43,777 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:43,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-04 17:29:43,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:43,778 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:43,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:43,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:43,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:43,912 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:29:43,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:43,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:29:43,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:29:43,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:29:43,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:29:43,913 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 17:29:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:43,940 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:29:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:29:43,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:29:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:43,940 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:29:43,941 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:29:43,941 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:29:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:29:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:29:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:29:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:29:43,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 17:29:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:43,943 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:29:43,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:29:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:29:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:29:43,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:43,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:43,943 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-02-04 17:29:43,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:43,944 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:43,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:43,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:43,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:43,980 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:29:43,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:43,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:29:43,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:29:43,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:29:43,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:29:43,981 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-02-04 17:29:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:44,054 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 17:29:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:29:44,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:29:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:44,055 INFO L225 Difference]: With dead ends: 34 [2018-02-04 17:29:44,055 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 17:29:44,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:29:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 17:29:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 17:29:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 17:29:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 17:29:44,058 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-02-04 17:29:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:44,058 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 17:29:44,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:29:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 17:29:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:29:44,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:44,059 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:44,059 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-02-04 17:29:44,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:44,059 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:44,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:44,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:44,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:44,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:29:44,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:44,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:29:44,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:29:44,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:29:44,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:29:44,118 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-02-04 17:29:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:44,218 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 17:29:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:29:44,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 17:29:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:44,221 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:29:44,221 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:29:44,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:29:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:29:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-02-04 17:29:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:29:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:29:44,225 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-02-04 17:29:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:44,225 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:29:44,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:29:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:29:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:29:44,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:44,226 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:29:44,226 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-02-04 17:29:44,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:44,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:44,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:44,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:44,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:44,256 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:44,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:44,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:44,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:44,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:44,318 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:29:44,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:29:44,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:44,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:44,346 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:29:44,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,371 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:29:44,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:29:44,415 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:29:44,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:44,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:29:44,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:29:44,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:29:44,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:29:44,416 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 7 states. [2018-02-04 17:29:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:44,477 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 17:29:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:29:44,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 17:29:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:44,480 INFO L225 Difference]: With dead ends: 35 [2018-02-04 17:29:44,480 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:29:44,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:29:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:29:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:29:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:29:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 17:29:44,483 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-02-04 17:29:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:44,483 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 17:29:44,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:29:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 17:29:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:29:44,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:44,484 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:29:44,484 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-02-04 17:29:44,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:44,485 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:44,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:44,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:44,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:44,502 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:44,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:44,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:44,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:44,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:44,545 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:29:44,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,552 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:29:44,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,562 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:29:44,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-02-04 17:29:44,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:44,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:44,584 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:29:44,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,594 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:29:44,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:44,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 17:29:44,704 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:29:44,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:44,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:29:44,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:29:44,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:29:44,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:29:44,705 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-02-04 17:29:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:45,058 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-02-04 17:29:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:29:45,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-02-04 17:29:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:45,059 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:29:45,059 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:29:45,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:29:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:29:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 17:29:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:29:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 17:29:45,064 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 19 [2018-02-04 17:29:45,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:45,064 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 17:29:45,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:29:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 17:29:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:29:45,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:45,065 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:29:45,065 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -136454879, now seen corresponding path program 1 times [2018-02-04 17:29:45,065 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:45,065 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:45,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:45,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:45,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:45,080 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:45,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:45,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:45,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:45,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:45,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:29:45,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,125 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:29:45,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,129 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:29:45,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:45,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:45,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:45,148 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:29:45,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,159 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:29:45,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,172 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:29:45,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-02-04 17:29:45,198 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:29:45,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:45,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:29:45,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:29:45,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:29:45,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:29:45,200 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-02-04 17:29:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:45,284 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-02-04 17:29:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:29:45,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 17:29:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:45,286 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:29:45,286 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:29:45,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:29:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:29:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2018-02-04 17:29:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:29:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:29:45,289 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-02-04 17:29:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:45,290 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:29:45,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:29:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:29:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:29:45,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:45,291 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:45,291 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:45,291 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-02-04 17:29:45,291 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:45,291 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:45,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:45,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:45,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:29:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:45,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:45,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:29:45,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:29:45,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:29:45,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:29:45,383 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-02-04 17:29:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:45,457 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-02-04 17:29:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:29:45,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 17:29:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:45,458 INFO L225 Difference]: With dead ends: 58 [2018-02-04 17:29:45,458 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 17:29:45,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:29:45,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 17:29:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-02-04 17:29:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 17:29:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-02-04 17:29:45,462 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-02-04 17:29:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:45,462 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-02-04 17:29:45,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:29:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-02-04 17:29:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:29:45,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:45,463 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:45,463 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-02-04 17:29:45,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:45,464 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:45,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:45,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:45,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:45,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:45,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:45,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:45,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:45,622 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:29:45,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:29:45,652 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:29:45,654 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:29:45,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:45,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:29:45,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:29:45,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:29:45,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:45,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:45,730 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:29:45,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:29:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:45,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:29:45,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-02-04 17:29:45,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:29:45,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:29:45,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:29:45,779 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 19 states. [2018-02-04 17:29:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:46,082 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 17:29:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:29:46,082 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 17:29:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:46,082 INFO L225 Difference]: With dead ends: 65 [2018-02-04 17:29:46,082 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 17:29:46,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:29:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 17:29:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-02-04 17:29:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:29:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 17:29:46,085 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-02-04 17:29:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:46,086 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 17:29:46,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:29:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 17:29:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:29:46,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:46,086 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:29:46,086 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-02-04 17:29:46,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:46,087 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:46,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:46,087 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:46,087 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:46,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:46,099 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:46,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:46,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:46,100 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:46,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:46,136 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:29:46,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,142 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:29:46,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,148 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:29:46,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-02-04 17:29:46,164 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:46,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, 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:29:46,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:46,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:46,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:29:46,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,178 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:29:46,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 17:29:46,261 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:29:46,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:46,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:29:46,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:29:46,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:29:46,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:29:46,262 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 14 states. [2018-02-04 17:29:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:46,532 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-04 17:29:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:29:46,532 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-02-04 17:29:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:46,533 INFO L225 Difference]: With dead ends: 64 [2018-02-04 17:29:46,533 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 17:29:46,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:29:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 17:29:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-02-04 17:29:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 17:29:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 17:29:46,537 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 24 [2018-02-04 17:29:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:46,537 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 17:29:46,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:29:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 17:29:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:29:46,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:46,538 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:46,538 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-02-04 17:29:46,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:46,539 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:46,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:46,540 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:46,540 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:46,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:46,560 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:46,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:46,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:46,561 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:29:46,584 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:29:46,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:46,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:46,615 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:29:46,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:29:46,622 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:29:46,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:46,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:46,629 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:29:46,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:29:46,657 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:29:46,665 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:29:46,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 17:29:46,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-04 17:29:46,737 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:29:46,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:46,745 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:29:46,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2018-02-04 17:29:46,771 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:29:46,776 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:29:46,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:46,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:46,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:46,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:29:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:46,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:46,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 17:29:46,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:29:46,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:29:46,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:29:46,828 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 14 states. [2018-02-04 17:29:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:47,082 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-04 17:29:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:29:47,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 17:29:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:47,083 INFO L225 Difference]: With dead ends: 70 [2018-02-04 17:29:47,083 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 17:29:47,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:29:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 17:29:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2018-02-04 17:29:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:29:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-04 17:29:47,087 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-02-04 17:29:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:47,088 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-04 17:29:47,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:29:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-04 17:29:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:29:47,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:47,089 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] [2018-02-04 17:29:47,089 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-02-04 17:29:47,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:47,089 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:47,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,090 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:47,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:47,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:29:47,098 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:47,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:47,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:47,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:47,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:47,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:47,135 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:29:47,137 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:29:47,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,144 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:29:47,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-02-04 17:29:47,162 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:29:47,181 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:29:47,184 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:29:47,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:29:47,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:29:47,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:29:47,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:29:47,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-02-04 17:29:47,185 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-02-04 17:29:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:47,223 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 17:29:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:29:47,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 17:29:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:47,224 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:29:47,224 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 17:29:47,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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:29:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 17:29:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 17:29:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 17:29:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-02-04 17:29:47,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-02-04 17:29:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:47,227 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-02-04 17:29:47,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:29:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-02-04 17:29:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:29:47,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:47,227 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:29:47,228 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash -587330175, now seen corresponding path program 2 times [2018-02-04 17:29:47,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:47,228 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:47,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:47,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:47,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:29:47,240 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:47,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:47,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:47,240 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:29:47,274 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:29:47,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:47,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:47,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:29:47,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,298 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:29:47,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,305 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:29:47,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:47,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:47,322 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:29:47,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:47,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:47,332 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:29:47,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,340 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:29:47,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:47,450 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:29:47,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:47,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 17:29:47,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:29:47,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:29:47,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:29:47,451 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2018-02-04 17:29:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:47,683 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-02-04 17:29:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:29:47,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-02-04 17:29:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:47,683 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:29:47,683 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:29:47,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:29:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:29:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-02-04 17:29:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:29:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-02-04 17:29:47,686 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-02-04 17:29:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:47,686 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-02-04 17:29:47,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:29:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-02-04 17:29:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:29:47,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:47,687 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:47,687 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -332118044, now seen corresponding path program 3 times [2018-02-04 17:29:47,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:47,687 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:47,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,687 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:47,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:47,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:47,725 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:47,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:47,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:47,726 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:29:47,765 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:29:47,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:47,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:47,778 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:29:47,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:29:47,803 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:29:47,805 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:29:47,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 17:29:47,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 36 [2018-02-04 17:29:47,877 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2018-02-04 17:29:47,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:47,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 21 treesize of output 20 [2018-02-04 17:29:47,892 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:47,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:47,912 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:41 [2018-02-04 17:29:47,972 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 38 treesize of output 35 [2018-02-04 17:29:47,974 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:29:47,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:47,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:48,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2018-02-04 17:29:48,019 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-02-04 17:29:48,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 17:29:48,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:48,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 17:29:48,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:69, output treesize:46 [2018-02-04 17:29:48,112 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 33 treesize of output 29 [2018-02-04 17:29:48,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:29:48,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:35 [2018-02-04 17:29:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:48,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:48,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:29:48,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:29:48,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:29:48,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:29:48,214 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-02-04 17:29:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:48,474 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 17:29:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:29:48,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-04 17:29:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:48,474 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:29:48,475 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:29:48,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:29:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:29:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-04 17:29:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:29:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-04 17:29:48,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-02-04 17:29:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:48,479 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-04 17:29:48,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:29:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-04 17:29:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:29:48,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:48,480 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:29:48,480 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1705724824, now seen corresponding path program 3 times [2018-02-04 17:29:48,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:48,481 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:48,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:48,481 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:48,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:48,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:48,493 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:48,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:48,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:48,494 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:29:48,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:29:48,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:48,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:48,571 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:29:48,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:48,632 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:29:48,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:29:48,673 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:29:48,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:48,683 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:29:48,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:29:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:48,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:48,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 17:29:48,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:29:48,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:29:48,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:29:48,854 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 15 states. [2018-02-04 17:29:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:49,114 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-02-04 17:29:49,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:29:49,115 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-04 17:29:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:49,115 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:29:49,116 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:29:49,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:29:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:29:49,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-04 17:29:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:29:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-04 17:29:49,118 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-02-04 17:29:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:49,118 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-04 17:29:49,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:29:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-04 17:29:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:29:49,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:49,119 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:49,119 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:49,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1048519499, now seen corresponding path program 4 times [2018-02-04 17:29:49,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:49,120 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:49,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:49,120 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:49,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:49,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:49,156 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:49,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:49,156 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:49,157 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:29:49,188 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:29:49,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:49,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:49,199 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:29:49,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:29:49,208 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:29:49,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:49,216 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:29:49,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 17:29:49,240 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:29:49,242 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:29:49,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:29:49,298 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:29:49,300 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:29:49,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,310 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:29:49,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-02-04 17:29:49,331 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:29:49,334 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:29:49,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,345 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:29:49,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-02-04 17:29:49,367 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:29:49,370 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:29:49,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,382 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:29:49,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-02-04 17:29:49,412 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:29:49,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, 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:29:49,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:49,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:49,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:29:49,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:29:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:49,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:49,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:29:49,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:29:49,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:29:49,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:29:49,496 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-02-04 17:29:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:49,820 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-04 17:29:49,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:29:49,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-02-04 17:29:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:49,821 INFO L225 Difference]: With dead ends: 42 [2018-02-04 17:29:49,821 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 17:29:49,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:29:49,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 17:29:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-02-04 17:29:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:29:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-04 17:29:49,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-02-04 17:29:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:49,823 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-04 17:29:49,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:29:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-04 17:29:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:29:49,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:49,823 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:49,823 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1855633951, now seen corresponding path program 4 times [2018-02-04 17:29:49,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:49,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:49,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:49,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:49,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:49,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:49,838 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:49,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:49,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:49,839 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:29:49,868 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:29:49,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:49,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:49,903 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:29:49,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,915 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:29:49,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,921 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:29:49,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:49,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:49,940 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:29:49,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:49,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:49,947 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:29:49,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:49,951 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:29:49,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:29:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:50,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:50,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:29:50,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:29:50,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:29:50,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:29:50,060 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 16 states. [2018-02-04 17:29:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:50,331 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-04 17:29:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:29:50,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-04 17:29:50,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:50,331 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:29:50,331 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:29:50,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:29:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:29:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-04 17:29:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:29:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 17:29:50,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2018-02-04 17:29:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:50,333 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 17:29:50,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:29:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 17:29:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:29:50,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:50,334 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:50,334 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1048463352, now seen corresponding path program 5 times [2018-02-04 17:29:50,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:50,334 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:50,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:50,335 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:50,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:50,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:50,344 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:50,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:50,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:50,344 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:29:50,385 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:29:50,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:50,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:50,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:29:50,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,399 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:29:50,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,404 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:29:50,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:50,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:50,418 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:29:50,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:50,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:50,428 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:29:50,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,437 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:29:50,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-02-04 17:29:50,541 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:29:50,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:50,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:50,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:50,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:29:50,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:29:50,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:29:50,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:29:50,707 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-02-04 17:29:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:51,252 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 17:29:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:29:51,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-04 17:29:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:51,253 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:29:51,253 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 17:29:51,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:29:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 17:29:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-02-04 17:29:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:29:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 17:29:51,255 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-02-04 17:29:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:51,255 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 17:29:51,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:29:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 17:29:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 17:29:51,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:51,256 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:51,256 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash 233408065, now seen corresponding path program 6 times [2018-02-04 17:29:51,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:51,256 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:51,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:51,257 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:51,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:51,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:51,272 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:51,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:51,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:51,273 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:29:51,347 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:29:51,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:51,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:51,359 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:29:51,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:51,367 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:29:51,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:51,372 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:29:51,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:51,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:51,392 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:29:51,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:51,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:51,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:51,404 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:29:51,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:51,411 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:29:51,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:51,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:51,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 17:29:51,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:29:51,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:29:51,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:29:51,625 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 17 states. [2018-02-04 17:29:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:52,103 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-02-04 17:29:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:29:52,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-02-04 17:29:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:52,104 INFO L225 Difference]: With dead ends: 57 [2018-02-04 17:29:52,104 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 17:29:52,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:29:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 17:29:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-02-04 17:29:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:29:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 17:29:52,106 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-02-04 17:29:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:52,106 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 17:29:52,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:29:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 17:29:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 17:29:52,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:52,107 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:52,107 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1366733736, now seen corresponding path program 7 times [2018-02-04 17:29:52,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:52,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:52,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:52,108 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:52,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:52,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:52,122 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:52,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:52,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:52,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:52,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:52,184 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:29:52,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:52,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:29:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:52,196 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:29:52,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:52,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:52,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:52,215 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:29:52,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:52,225 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:29:52,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:52,232 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:29:52,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:52,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:52,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 17:29:52,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:29:52,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:29:52,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:29:52,446 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 18 states. [2018-02-04 17:29:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:52,963 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-02-04 17:29:52,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:29:52,963 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-02-04 17:29:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:52,964 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:29:52,964 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:29:52,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:29:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:29:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-02-04 17:29:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 17:29:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-02-04 17:29:52,965 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-02-04 17:29:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:52,965 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-02-04 17:29:52,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:29:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-02-04 17:29:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 17:29:52,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:52,966 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:52,966 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1210003807, now seen corresponding path program 8 times [2018-02-04 17:29:52,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:52,966 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:52,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:52,967 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:52,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:52,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:52,984 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:52,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:52,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:52,985 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:29:53,060 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:29:53,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:53,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:53,086 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:29:53,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:53,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:29:53,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:53,098 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:29:53,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:53,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:53,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:53,115 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:29:53,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:53,121 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:29:53,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:53,126 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:29:53,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:53,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:53,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 17:29:53,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:29:53,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:29:53,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:29:53,361 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 19 states. [2018-02-04 17:29:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:53,966 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 17:29:53,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:29:53,966 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-02-04 17:29:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:53,967 INFO L225 Difference]: With dead ends: 67 [2018-02-04 17:29:53,967 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 17:29:53,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:29:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 17:29:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 17:29:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 17:29:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-02-04 17:29:53,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-02-04 17:29:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:53,969 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-02-04 17:29:53,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:29:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-02-04 17:29:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 17:29:53,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:53,969 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:53,969 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -895637688, now seen corresponding path program 9 times [2018-02-04 17:29:53,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:53,970 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:53,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:53,970 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:53,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:53,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:53,990 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:53,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:53,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:53,990 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:29:54,058 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:29:54,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:54,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:54,066 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:29:54,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,071 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:29:54,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,076 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:29:54,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:54,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:54,089 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:29:54,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:54,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:54,108 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:29:54,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,114 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:29:54,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:29:54,251 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:29:54,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:29:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:54,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:54,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:29:54,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:29:54,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:29:54,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:29:54,339 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 21 states. [2018-02-04 17:29:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:54,908 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-02-04 17:29:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:29:54,908 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 17:29:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:54,908 INFO L225 Difference]: With dead ends: 72 [2018-02-04 17:29:54,908 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 17:29:54,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:29:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 17:29:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-04 17:29:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 17:29:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-02-04 17:29:54,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-02-04 17:29:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:54,910 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-02-04 17:29:54,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:29:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-02-04 17:29:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 17:29:54,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:54,911 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:54,911 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:54,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1054793983, now seen corresponding path program 10 times [2018-02-04 17:29:54,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:54,911 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:54,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:54,911 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:54,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:54,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:54,923 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:54,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:54,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:54,924 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:29:54,964 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:29:54,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:54,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:54,974 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:29:54,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:54,979 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:29:54,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29: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:29:54,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:54,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:54,996 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:29:54,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:55,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:55,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:55,004 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:29:55,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:55,009 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:29:55,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:29:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:55,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:55,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:29:55,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:29:55,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:29:55,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:29:55,429 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 22 states. [2018-02-04 17:29:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:56,053 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-02-04 17:29:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:29:56,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-02-04 17:29:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:56,053 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:29:56,053 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:29:56,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:29:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:29:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-04 17:29:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 17:29:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-02-04 17:29:56,055 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2018-02-04 17:29:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:56,055 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-02-04 17:29:56,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:29:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-02-04 17:29:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 17:29:56,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:56,055 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:56,055 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1327459608, now seen corresponding path program 11 times [2018-02-04 17:29:56,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:56,056 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:56,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:56,056 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:56,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:56,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:56,067 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:56,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:56,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:56,068 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:29:56,126 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:29:56,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:56,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:56,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:29:56,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:56,154 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:29:56,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:29:56,169 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:29:56,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:29:56,189 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:29:56,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:29:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:56,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:56,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:29:56,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:29:56,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:29:56,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:29:56,580 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 21 states. [2018-02-04 17:29:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:57,109 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-02-04 17:29:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:29:57,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2018-02-04 17:29:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:57,110 INFO L225 Difference]: With dead ends: 82 [2018-02-04 17:29:57,110 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 17:29:57,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:29:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 17:29:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-02-04 17:29:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:29:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-02-04 17:29:57,111 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2018-02-04 17:29:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:57,112 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-02-04 17:29:57,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:29:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-02-04 17:29:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 17:29:57,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:57,112 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:57,112 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2013235359, now seen corresponding path program 12 times [2018-02-04 17:29:57,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:57,112 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:57,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:57,113 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:57,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:57,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:29:57,126 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:57,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:57,127 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:57,127 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:29:57,193 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:29:57,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:57,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:57,203 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:29:57,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:57,217 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:29:57,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:57,221 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:29:57,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:57,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:57,234 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:29:57,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:57,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:57,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:57,243 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:29:57,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:57,274 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:29:57,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:57,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:57,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 17:29:57,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:29:57,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:29:57,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:29:57,605 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 23 states. [2018-02-04 17:29:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:58,257 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-02-04 17:29:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:29:58,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-02-04 17:29:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:58,258 INFO L225 Difference]: With dead ends: 87 [2018-02-04 17:29:58,258 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 17:29:58,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:29:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 17:29:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-02-04 17:29:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 17:29:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 17:29:58,260 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2018-02-04 17:29:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:58,260 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 17:29:58,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:29:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 17:29:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 17:29:58,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:58,261 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:58,261 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash 732526216, now seen corresponding path program 13 times [2018-02-04 17:29:58,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:58,261 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:58,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:58,262 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:29:58,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:58,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:58,283 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:58,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:58,283 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:58,284 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:58,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:58,351 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:29:58,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:58,356 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:29:58,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:58,360 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:29:58,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:58,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:58,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:58,373 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:29:58,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:58,381 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:29:58,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:58,385 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:29:58,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:29:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:29:58,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:29:58,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:29:58,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:29:58,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:29:58,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:29:58,779 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 25 states. [2018-02-04 17:29:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:29:59,552 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-02-04 17:29:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:29:59,552 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-02-04 17:29:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:29:59,553 INFO L225 Difference]: With dead ends: 92 [2018-02-04 17:29:59,553 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 17:29:59,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=1916, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:29:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 17:29:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-02-04 17:29:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 17:29:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-02-04 17:29:59,555 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2018-02-04 17:29:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:29:59,555 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-02-04 17:29:59,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:29:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-02-04 17:29:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 17:29:59,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:29:59,556 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:29:59,557 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:29:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -145434687, now seen corresponding path program 14 times [2018-02-04 17:29:59,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:29:59,557 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:29:59,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:59,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:29:59,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:29:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:29:59,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:29:59,583 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:29:59,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:29:59,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:29:59,583 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:29:59,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:29:59,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:29:59,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:29:59,686 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:29:59,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:59,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:29:59,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:59,695 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:29:59,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:29:59,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:59,708 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:29:59,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:59,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:59,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:29:59,717 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:29:59,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:29:59,721 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:29:59,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:00,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:00,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 17:30:00,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:30:00,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:30:00,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:30:00,065 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 26 states. [2018-02-04 17:30:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:00,842 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-02-04 17:30:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:30:00,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-02-04 17:30:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:00,842 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:30:00,843 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:30:00,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 17:30:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:30:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-04 17:30:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 17:30:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-02-04 17:30:00,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 89 [2018-02-04 17:30:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:00,845 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-02-04 17:30:00,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:30:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-02-04 17:30:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 17:30:00,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:00,845 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:00,845 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1511894488, now seen corresponding path program 15 times [2018-02-04 17:30:00,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:00,845 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:00,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:00,846 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:00,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:00,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:00,868 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:00,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:00,869 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:00,869 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:30:01,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:30:01,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:01,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:01,034 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:30:01,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:01,038 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:30:01,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:01,102 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:30:01,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:01,108 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:30:01,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:30:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:01,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:01,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:30:01,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:30:01,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:30:01,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:30:01,453 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 27 states. [2018-02-04 17:30:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:02,219 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-02-04 17:30:02,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:30:02,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-02-04 17:30:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:02,219 INFO L225 Difference]: With dead ends: 102 [2018-02-04 17:30:02,219 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 17:30:02,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:30:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 17:30:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-04 17:30:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 17:30:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-02-04 17:30:02,222 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2018-02-04 17:30:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:02,222 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-02-04 17:30:02,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:30:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-02-04 17:30:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 17:30:02,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:02,223 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:02,223 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash -428589023, now seen corresponding path program 16 times [2018-02-04 17:30:02,223 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:02,224 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:02,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:02,224 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:02,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:02,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:02,243 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:02,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:02,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:02,244 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:30:02,334 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:30:02,334 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:02,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:02,363 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:30:02,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:02,368 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:30:02,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:02,372 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:30:02,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:02,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:02,385 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:30:02,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:02,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:02,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:02,393 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:30:02,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:02,397 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:30:02,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:02,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:02,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 17:30:02,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 17:30:02,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 17:30:02,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:30:02,747 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 27 states. [2018-02-04 17:30:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:03,676 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-02-04 17:30:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:30:03,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-02-04 17:30:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:03,677 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:30:03,677 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 17:30:03,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:30:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 17:30:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-04 17:30:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 17:30:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-02-04 17:30:03,679 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2018-02-04 17:30:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:03,679 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-02-04 17:30:03,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 17:30:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-02-04 17:30:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 17:30:03,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:03,679 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:03,679 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1844782536, now seen corresponding path program 17 times [2018-02-04 17:30:03,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:03,680 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:03,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:03,680 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:03,680 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:03,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:03,694 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:03,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:03,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:03,695 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:30:03,865 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:30:03,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:03,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:03,879 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:30:03,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:03,885 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:30:03,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:03,889 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:30:03,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:03,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:03,903 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:30:03,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:03,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:03,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:03,912 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:30:03,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:03,916 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:30:03,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:04,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:04,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 17:30:04,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 17:30:04,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 17:30:04,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:30:04,287 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 28 states. [2018-02-04 17:30:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:05,341 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-02-04 17:30:05,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:30:05,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-02-04 17:30:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:05,342 INFO L225 Difference]: With dead ends: 112 [2018-02-04 17:30:05,342 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 17:30:05,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:30:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 17:30:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 17:30:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 17:30:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-02-04 17:30:05,345 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 104 [2018-02-04 17:30:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:05,345 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-02-04 17:30:05,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 17:30:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-02-04 17:30:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 17:30:05,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:05,346 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:05,346 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2033496193, now seen corresponding path program 18 times [2018-02-04 17:30:05,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:05,346 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:05,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:05,346 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:05,347 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:05,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:05,362 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:05,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:05,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:05,362 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:30:05,486 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:30:05,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:05,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:05,509 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:30:05,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:05,515 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:30:05,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:05,519 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:30:05,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:05,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:05,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:05,531 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:30:05,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:05,563 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:30:05,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:05,567 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:30:05,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:05,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:05,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:30:05,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:30:05,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:30:05,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:30:05,934 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 29 states. [2018-02-04 17:30:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:06,975 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-02-04 17:30:06,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:30:06,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-02-04 17:30:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:06,976 INFO L225 Difference]: With dead ends: 117 [2018-02-04 17:30:06,976 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 17:30:06,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:30:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 17:30:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-04 17:30:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 17:30:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-02-04 17:30:06,978 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 109 [2018-02-04 17:30:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:06,978 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-02-04 17:30:06,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:30:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-02-04 17:30:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 17:30:06,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:06,979 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:06,979 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1439428968, now seen corresponding path program 19 times [2018-02-04 17:30:06,979 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:06,979 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:06,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:06,979 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:06,979 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:06,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:06,996 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:06,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:06,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:06,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:07,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:07,149 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:30:07,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:07,154 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:30:07,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:07,158 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:30:07,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:07,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:07,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:07,171 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:30:07,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:07,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:30:07,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:07,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:30:07,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:07,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:07,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-04 17:30:07,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:30:07,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:30:07,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:30:07,760 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 30 states. [2018-02-04 17:30:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:09,170 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-02-04 17:30:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:30:09,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-02-04 17:30:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:09,171 INFO L225 Difference]: With dead ends: 122 [2018-02-04 17:30:09,171 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 17:30:09,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=2902, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:30:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 17:30:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-04 17:30:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 17:30:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-02-04 17:30:09,173 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 114 [2018-02-04 17:30:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:09,174 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-02-04 17:30:09,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:30:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-02-04 17:30:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 17:30:09,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:09,175 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:09,175 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2146183393, now seen corresponding path program 20 times [2018-02-04 17:30:09,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:09,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:09,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:09,175 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:09,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:09,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:09,200 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:09,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:09,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:09,200 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:30:09,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:30:09,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:09,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:09,322 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:30:09,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:09,327 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:30:09,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:09,331 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:30:09,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:09,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:09,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:09,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:30:09,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:09,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:30:09,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:09,355 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:30:09,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:09,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:09,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 17:30:09,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 17:30:09,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 17:30:09,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:30:09,834 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 32 states. [2018-02-04 17:30:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:11,084 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-02-04 17:30:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:30:11,084 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-02-04 17:30:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:11,085 INFO L225 Difference]: With dead ends: 127 [2018-02-04 17:30:11,085 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 17:30:11,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:30:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 17:30:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-02-04 17:30:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 17:30:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-02-04 17:30:11,087 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 119 [2018-02-04 17:30:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:11,087 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-02-04 17:30:11,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 17:30:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-02-04 17:30:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-04 17:30:11,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:11,088 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:11,088 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1389409544, now seen corresponding path program 21 times [2018-02-04 17:30:11,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:11,088 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:11,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:11,088 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:11,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:11,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:11,109 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:11,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:11,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:11,109 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:30:11,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:30:11,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:11,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:11,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:30:11,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:11,315 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:30:11,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:11,327 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:30:11,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:11,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:30:11,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-04 17:30:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:11,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:11,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:30:11,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:30:11,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:30:11,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1052, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:30:11,794 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 34 states. [2018-02-04 17:30:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:12,958 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-02-04 17:30:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:30:12,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2018-02-04 17:30:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:12,959 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:30:12,959 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:30:12,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=3701, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:30:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:30:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-04 17:30:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 17:30:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-02-04 17:30:12,961 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 124 [2018-02-04 17:30:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:12,961 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-02-04 17:30:12,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:30:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-02-04 17:30:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-04 17:30:12,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:12,961 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:12,962 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:12,962 INFO L82 PathProgramCache]: Analyzing trace with hash -680482495, now seen corresponding path program 22 times [2018-02-04 17:30:12,962 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:12,962 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:12,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:12,962 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:12,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:12,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:12,993 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:12,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:12,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:12,994 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:30:13,088 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:30:13,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:13,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:13,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:30:13,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:13,124 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:30:13,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:13,130 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:30:13,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:13,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:13,148 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:30:13,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:13,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:13,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:13,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:30:13,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:13,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:30:13,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:13,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:13,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 17:30:13,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 17:30:13,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 17:30:13,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 17:30:13,673 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 34 states. [2018-02-04 17:30:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:15,036 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-02-04 17:30:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:30:15,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 129 [2018-02-04 17:30:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:15,037 INFO L225 Difference]: With dead ends: 137 [2018-02-04 17:30:15,037 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 17:30:15,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=3827, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:30:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 17:30:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-02-04 17:30:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 17:30:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-02-04 17:30:15,040 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 129 [2018-02-04 17:30:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:15,040 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-02-04 17:30:15,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 17:30:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-02-04 17:30:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-02-04 17:30:15,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:15,040 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:15,040 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:15,041 INFO L82 PathProgramCache]: Analyzing trace with hash 502100136, now seen corresponding path program 23 times [2018-02-04 17:30:15,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:15,041 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:15,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:15,041 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:15,041 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:15,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:15,064 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:15,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:15,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:15,064 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:30:15,310 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:30:15,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:15,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:15,327 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:30:15,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:15,330 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:30:15,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:15,343 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:30:15,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:15,350 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:30:15,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:30:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:15,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:15,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 17:30:15,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 17:30:15,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 17:30:15,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 17:30:15,845 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 33 states. [2018-02-04 17:30:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:17,175 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-02-04 17:30:17,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:30:17,175 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2018-02-04 17:30:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:17,176 INFO L225 Difference]: With dead ends: 142 [2018-02-04 17:30:17,176 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 17:30:17,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=3589, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:30:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 17:30:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-02-04 17:30:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 17:30:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-02-04 17:30:17,179 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-02-04 17:30:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:17,179 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-02-04 17:30:17,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 17:30:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-02-04 17:30:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-04 17:30:17,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:17,180 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:17,180 INFO L371 AbstractCegarLoop]: === Iteration 39 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:17,180 INFO L82 PathProgramCache]: Analyzing trace with hash -921161311, now seen corresponding path program 24 times [2018-02-04 17:30:17,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:17,181 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:17,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:17,181 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:17,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:17,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:17,213 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:17,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:17,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:17,213 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:30:17,479 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:30:17,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:17,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:17,496 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:30:17,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:17,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 6 treesize of output 5 [2018-02-04 17:30:17,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:17,503 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:30:17,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:17,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:17,513 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:30:17,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:17,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:17,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:17,520 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:30:17,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:17,525 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:30:17,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:18,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:18,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 17:30:18,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:30:18,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:30:18,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:30:18,075 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 35 states. [2018-02-04 17:30:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:19,684 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-02-04 17:30:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:30:19,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-02-04 17:30:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:19,685 INFO L225 Difference]: With dead ends: 147 [2018-02-04 17:30:19,685 INFO L226 Difference]: Without dead ends: 147 [2018-02-04 17:30:19,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:30:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-04 17:30:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-02-04 17:30:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-04 17:30:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-02-04 17:30:19,688 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-02-04 17:30:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:19,688 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-02-04 17:30:19,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:30:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-02-04 17:30:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-04 17:30:19,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:19,689 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:19,689 INFO L371 AbstractCegarLoop]: === Iteration 40 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -745790392, now seen corresponding path program 25 times [2018-02-04 17:30:19,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:19,690 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:19,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:19,690 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:19,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:19,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:19,714 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:19,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:19,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:19,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:19,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:19,888 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:30:19,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:19,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:30:19,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:19,895 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:30:19,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:19,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:19,905 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:30:19,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:19,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:19,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:19,912 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:30:19,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:19,916 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:30:19,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:20,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:20,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-04 17:30:20,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:30:20,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:30:20,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:30:20,519 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 37 states. [2018-02-04 17:30:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:22,159 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-02-04 17:30:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:30:22,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-02-04 17:30:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:22,160 INFO L225 Difference]: With dead ends: 152 [2018-02-04 17:30:22,160 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 17:30:22,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=4607, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:30:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 17:30:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-04 17:30:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 17:30:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-02-04 17:30:22,162 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2018-02-04 17:30:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:22,162 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-02-04 17:30:22,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:30:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-02-04 17:30:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-02-04 17:30:22,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:22,163 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:22,163 INFO L371 AbstractCegarLoop]: === Iteration 41 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:22,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1790493185, now seen corresponding path program 26 times [2018-02-04 17:30:22,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:22,163 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:22,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:22,163 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:22,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:22,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:22,186 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:22,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:22,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:22,187 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:30:22,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:30:22,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:22,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:22,361 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:30:22,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:22,368 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:30:22,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:22,373 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:30:22,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:22,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:22,389 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:30:22,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:22,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:22,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:22,397 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:30:22,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:22,401 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:30:22,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:23,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:23,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 17:30:23,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:30:23,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:30:23,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:30:23,088 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 38 states. [2018-02-04 17:30:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:24,945 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-02-04 17:30:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:30:24,945 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-02-04 17:30:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:24,945 INFO L225 Difference]: With dead ends: 157 [2018-02-04 17:30:24,946 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 17:30:24,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:30:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 17:30:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-02-04 17:30:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 17:30:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-02-04 17:30:24,948 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 149 [2018-02-04 17:30:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:24,948 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-02-04 17:30:24,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:30:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-02-04 17:30:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 17:30:24,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:24,949 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:24,949 INFO L371 AbstractCegarLoop]: === Iteration 42 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1818832920, now seen corresponding path program 27 times [2018-02-04 17:30:24,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:24,949 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:24,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:24,950 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:24,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:24,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:24,978 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:24,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:24,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:24,979 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:30:25,338 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:30:25,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:25,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:25,367 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:30:25,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,374 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:30:25,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,380 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:30:25,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:25,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:25,398 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:30:25,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30: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:30:25,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,423 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:30:25,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:25,930 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:30:25,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:30:25,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:30:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:26,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:26,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:30:26,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:30:26,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:30:26,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:30:26,110 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 39 states. [2018-02-04 17:30:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:28,270 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-02-04 17:30:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:30:28,270 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-02-04 17:30:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:28,271 INFO L225 Difference]: With dead ends: 162 [2018-02-04 17:30:28,271 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 17:30:28,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=5167, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:30:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 17:30:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-02-04 17:30:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 17:30:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-02-04 17:30:28,273 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2018-02-04 17:30:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:28,273 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-02-04 17:30:28,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:30:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-02-04 17:30:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-04 17:30:28,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:28,274 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:28,274 INFO L371 AbstractCegarLoop]: === Iteration 43 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash -22521247, now seen corresponding path program 28 times [2018-02-04 17:30:28,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:28,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:28,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:28,274 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:28,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:28,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:28,319 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:28,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:28,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:28,320 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:30:28,435 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:30:28,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:28,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:28,455 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:30:28,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:28,460 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:30:28,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:28,464 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:30:28,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:28,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:28,484 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:30:28,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:28,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:28,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:28,496 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:30:28,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:28,502 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:30:28,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:29,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:29,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:30:29,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:30:29,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:30:29,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:30:29,153 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 39 states. [2018-02-04 17:30:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:31,306 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-02-04 17:30:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:30:31,306 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 159 [2018-02-04 17:30:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:31,307 INFO L225 Difference]: With dead ends: 167 [2018-02-04 17:30:31,307 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 17:30:31,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:30:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 17:30:31,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-04 17:30:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 17:30:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-02-04 17:30:31,309 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 159 [2018-02-04 17:30:31,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:31,309 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-02-04 17:30:31,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:30:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-02-04 17:30:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-04 17:30:31,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:31,310 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:31,310 INFO L371 AbstractCegarLoop]: === Iteration 44 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 561476488, now seen corresponding path program 29 times [2018-02-04 17:30:31,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:31,310 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:31,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:31,311 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:31,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:31,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:31,338 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:31,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:31,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:31,339 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:30:31,603 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:30:31,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:31,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:31,627 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:30:31,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:31,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:30:31,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:31,634 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:30:31,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:31,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:31,644 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:30:31,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:31,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:31,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:31,651 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:30:31,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:31,655 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:30:31,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:32,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:32,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-04 17:30:32,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 17:30:32,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 17:30:32,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 17:30:32,346 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 39 states. [2018-02-04 17:30:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:34,375 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-02-04 17:30:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:30:34,375 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 164 [2018-02-04 17:30:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:34,376 INFO L225 Difference]: With dead ends: 172 [2018-02-04 17:30:34,376 INFO L226 Difference]: Without dead ends: 172 [2018-02-04 17:30:34,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=5173, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:30:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-04 17:30:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-04 17:30:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 17:30:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-02-04 17:30:34,379 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 164 [2018-02-04 17:30:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:34,379 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-02-04 17:30:34,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 17:30:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-02-04 17:30:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 17:30:34,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:34,380 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:34,380 INFO L371 AbstractCegarLoop]: === Iteration 45 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1404893889, now seen corresponding path program 30 times [2018-02-04 17:30:34,380 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:34,381 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:34,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:34,381 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:34,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:34,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:34,417 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:34,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:34,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:34,418 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:30:34,943 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:30:34,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:34,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:34,978 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:30:34,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:34,983 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:30:34,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:34,995 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:30:34,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:35,001 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:30:35,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:30:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:35,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:35,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-04 17:30:35,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:30:35,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:30:35,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:30:35,723 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 41 states. [2018-02-04 17:30:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:37,712 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-02-04 17:30:37,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:30:37,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-02-04 17:30:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:37,713 INFO L225 Difference]: With dead ends: 177 [2018-02-04 17:30:37,713 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 17:30:37,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=5762, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:30:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 17:30:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-02-04 17:30:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:30:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-04 17:30:37,716 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 169 [2018-02-04 17:30:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:37,717 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-04 17:30:37,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:30:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-04 17:30:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-02-04 17:30:37,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:37,718 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:37,718 INFO L371 AbstractCegarLoop]: === Iteration 46 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2078798040, now seen corresponding path program 31 times [2018-02-04 17:30:37,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:37,718 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:37,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:37,719 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:37,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:37,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:30:37,751 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:37,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:37,751 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:37,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:38,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:38,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:30:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:38,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:30:38,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:38,058 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:30:38,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:38,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:38,071 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:30:38,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:38,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:38,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:38,083 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:30:38,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:38,087 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:30:38,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:38,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:38,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-04 17:30:38,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:30:38,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:30:38,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:30:38,871 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 43 states. [2018-02-04 17:30:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:41,101 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-02-04 17:30:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:30:41,101 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2018-02-04 17:30:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:41,102 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:30:41,102 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 17:30:41,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=6383, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 17:30:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 17:30:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-04 17:30:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 17:30:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-02-04 17:30:41,104 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 174 [2018-02-04 17:30:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:41,104 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-02-04 17:30:41,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:30:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-02-04 17:30:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-02-04 17:30:41,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:41,105 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:41,105 INFO L371 AbstractCegarLoop]: === Iteration 47 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 625779489, now seen corresponding path program 32 times [2018-02-04 17:30:41,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:41,105 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:41,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:41,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:30:41,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:41,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:41,137 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:41,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:41,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:41,138 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:30:41,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:30:41,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:41,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:41,729 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:30:41,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:41,734 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:30:41,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:41,737 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:30:41,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:41,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:41,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:41,749 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:30:41,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:41,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:30:41,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:41,784 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:30:41,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:42,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:42,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-04 17:30:42,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:30:42,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:30:42,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1804, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:30:42,636 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 44 states. [2018-02-04 17:30:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:45,133 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-02-04 17:30:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:30:45,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-02-04 17:30:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:45,134 INFO L225 Difference]: With dead ends: 187 [2018-02-04 17:30:45,134 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 17:30:45,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=6704, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:30:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 17:30:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-02-04 17:30:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 17:30:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-02-04 17:30:45,136 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 179 [2018-02-04 17:30:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:45,136 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-02-04 17:30:45,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:30:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-02-04 17:30:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-04 17:30:45,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:45,137 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:45,137 INFO L371 AbstractCegarLoop]: === Iteration 48 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1511873848, now seen corresponding path program 33 times [2018-02-04 17:30:45,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:45,137 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:45,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:45,137 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:45,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:45,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:45,173 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:45,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:45,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:45,174 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:30:45,557 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:30:45,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:45,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:45,576 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:30:45,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:45,579 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:30:45,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:45,590 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:30:45,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:45,595 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:30:45,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:30:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:46,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:46,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 17:30:46,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:30:46,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:30:46,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:30:46,423 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 45 states. [2018-02-04 17:30:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:48,777 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-02-04 17:30:48,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:30:48,777 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-02-04 17:30:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:48,778 INFO L225 Difference]: With dead ends: 192 [2018-02-04 17:30:48,778 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 17:30:48,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=7039, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:30:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 17:30:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-02-04 17:30:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 17:30:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-02-04 17:30:48,781 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 184 [2018-02-04 17:30:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:48,782 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-02-04 17:30:48,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:30:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-02-04 17:30:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 17:30:48,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:48,782 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:48,782 INFO L371 AbstractCegarLoop]: === Iteration 49 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2066568065, now seen corresponding path program 34 times [2018-02-04 17:30:48,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:48,783 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:48,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:48,783 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:48,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:48,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:48,817 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:48,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:48,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:48,818 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:30:49,256 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:30:49,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:49,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:49,295 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:30:49,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:49,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:30:49,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:49,313 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:30:49,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:49,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:49,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:49,335 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:30:49,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:49,341 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:30:49,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:49,346 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:30:49,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:30:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:50,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:50,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 17:30:50,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 17:30:50,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 17:30:50,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 17:30:50,252 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 46 states. [2018-02-04 17:30:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:53,006 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-02-04 17:30:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:30:53,006 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 189 [2018-02-04 17:30:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:53,007 INFO L225 Difference]: With dead ends: 197 [2018-02-04 17:30:53,007 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 17:30:53,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=7379, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 17:30:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 17:30:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-02-04 17:30:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 17:30:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-02-04 17:30:53,010 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2018-02-04 17:30:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:53,010 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-02-04 17:30:53,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 17:30:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-02-04 17:30:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-02-04 17:30:53,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:53,011 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:53,011 INFO L371 AbstractCegarLoop]: === Iteration 50 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -188666264, now seen corresponding path program 35 times [2018-02-04 17:30:53,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:53,011 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:53,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:53,013 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:53,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:53,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:53,050 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:53,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:53,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:53,050 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:30:53,801 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:30:53,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:53,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:53,831 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:30:53,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:53,835 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:30:53,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:53,838 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:30:53,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:30:53,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:53,850 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:30:53,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:53,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:53,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:30:53,859 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:30:53,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:53,863 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:30:53,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:30:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:54,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:54,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-04 17:30:54,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:30:54,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:30:54,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:30:54,799 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 45 states. [2018-02-04 17:30:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:30:57,577 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-02-04 17:30:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:30:57,577 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-02-04 17:30:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:30:57,578 INFO L225 Difference]: With dead ends: 202 [2018-02-04 17:30:57,578 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 17:30:57,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 17:30:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 17:30:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-02-04 17:30:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 17:30:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-02-04 17:30:57,581 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2018-02-04 17:30:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:30:57,581 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-02-04 17:30:57,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:30:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-02-04 17:30:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-02-04 17:30:57,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:30:57,582 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:30:57,582 INFO L371 AbstractCegarLoop]: === Iteration 51 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:30:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 162860001, now seen corresponding path program 36 times [2018-02-04 17:30:57,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:30:57,582 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:30:57,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:57,583 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:30:57,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:30:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:30:57,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:30:57,620 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:30:57,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:30:57,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:30:57,620 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:30:58,201 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:30:58,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:30:58,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:30:58,232 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:30:58,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:30:58,235 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:30:58,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:30:58,258 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:30:58,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:30:58,263 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:30:58,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:30:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:30:59,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:30:59,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-04 17:30:59,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:30:59,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:30:59,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:30:59,150 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 47 states. [2018-02-04 17:31:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:01,806 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-02-04 17:31:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:31:01,806 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-02-04 17:31:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:01,807 INFO L225 Difference]: With dead ends: 207 [2018-02-04 17:31:01,807 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 17:31:01,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=280, Invalid=7730, Unknown=0, NotChecked=0, Total=8010 [2018-02-04 17:31:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 17:31:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-04 17:31:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-04 17:31:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-02-04 17:31:01,809 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 199 [2018-02-04 17:31:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:01,809 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-02-04 17:31:01,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:31:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-02-04 17:31:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-02-04 17:31:01,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:01,810 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:01,810 INFO L371 AbstractCegarLoop]: === Iteration 52 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 35500552, now seen corresponding path program 37 times [2018-02-04 17:31:01,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:01,811 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:01,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:01,811 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:01,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:01,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:01,854 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:01,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:01,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:01,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:31:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:02,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:02,347 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:31:02,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:02,352 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:31:02,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:02,355 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:31:02,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:02,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:02,368 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:31:02,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:02,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:02,375 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:31:02,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:02,387 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:31:02,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:03,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:03,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-04 17:31:03,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:31:03,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:31:03,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:31:03,543 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 49 states. [2018-02-04 17:31:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:06,637 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-02-04 17:31:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:31:06,637 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-02-04 17:31:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:06,638 INFO L225 Difference]: With dead ends: 212 [2018-02-04 17:31:06,638 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 17:31:06,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=295, Invalid=8447, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 17:31:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 17:31:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-04 17:31:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 17:31:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-02-04 17:31:06,641 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 204 [2018-02-04 17:31:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:06,642 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-02-04 17:31:06,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:31:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-02-04 17:31:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-02-04 17:31:06,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:06,643 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:06,643 INFO L371 AbstractCegarLoop]: === Iteration 53 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1850094527, now seen corresponding path program 38 times [2018-02-04 17:31:06,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:06,643 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:06,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:06,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:31:06,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:06,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:06,685 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:06,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:06,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:06,686 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:31:07,453 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:31:07,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:07,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:07,491 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:31:07,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:07,495 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:31:07,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:07,499 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:31:07,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:07,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:07,509 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:31:07,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:07,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:07,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:07,516 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:31:07,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:07,519 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:31:07,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:08,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:08,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 17:31:08,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:31:08,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:31:08,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:31:08,541 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 50 states. [2018-02-04 17:31:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:11,739 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-02-04 17:31:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:31:11,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 209 [2018-02-04 17:31:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:11,740 INFO L225 Difference]: With dead ends: 217 [2018-02-04 17:31:11,740 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:31:11,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=301, Invalid=8819, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:31:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:31:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-02-04 17:31:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:31:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-02-04 17:31:11,743 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 209 [2018-02-04 17:31:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:11,743 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-02-04 17:31:11,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:31:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-02-04 17:31:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-02-04 17:31:11,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:11,744 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:11,744 INFO L371 AbstractCegarLoop]: === Iteration 54 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash 585248168, now seen corresponding path program 39 times [2018-02-04 17:31:11,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:11,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:11,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:11,745 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:11,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:11,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:11,793 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:11,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:11,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:11,794 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:31:12,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:31:12,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:12,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:12,444 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:31:12,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:12,449 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:31:12,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:12,452 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:31:12,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:12,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:12,463 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:31:12,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:12,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:12,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:12,470 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:31:12,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:12,474 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:31:12,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:31:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:13,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:13,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-04 17:31:13,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:31:13,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:31:13,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:31:13,499 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 50 states. [2018-02-04 17:31:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:16,687 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-02-04 17:31:16,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:31:16,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-02-04 17:31:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:16,688 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:31:16,688 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:31:16,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:31:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:31:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-02-04 17:31:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 17:31:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-02-04 17:31:16,691 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 214 [2018-02-04 17:31:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:16,691 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-02-04 17:31:16,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:31:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-02-04 17:31:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-04 17:31:16,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:16,692 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:16,693 INFO L371 AbstractCegarLoop]: === Iteration 55 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1083282593, now seen corresponding path program 40 times [2018-02-04 17:31:16,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:16,693 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:16,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:16,693 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:16,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:16,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:16,736 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:16,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:16,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:16,736 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:31:17,189 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:31:17,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:17,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:17,229 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:31:17,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:17,237 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:31:17,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:17,241 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:31:17,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:17,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:17,256 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:31:17,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:17,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:17,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:17,264 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:31:17,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:17,267 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:31:17,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:18,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:18,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 17:31:18,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:31:18,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:31:18,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:31:18,421 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 52 states. [2018-02-04 17:31:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:21,732 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-02-04 17:31:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:31:21,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 219 [2018-02-04 17:31:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:21,733 INFO L225 Difference]: With dead ends: 227 [2018-02-04 17:31:21,733 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 17:31:21,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=9587, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:31:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 17:31:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-02-04 17:31:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 17:31:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-02-04 17:31:21,735 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 219 [2018-02-04 17:31:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:21,735 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-02-04 17:31:21,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:31:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-02-04 17:31:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-04 17:31:21,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:21,736 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:21,736 INFO L371 AbstractCegarLoop]: === Iteration 56 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash 259563848, now seen corresponding path program 41 times [2018-02-04 17:31:21,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:21,736 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:21,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:21,737 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:21,737 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:21,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:21,780 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:21,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:21,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:21,781 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:31:22,111 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:31:22,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:22,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:22,161 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:31:22,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:22,163 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:31:22,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:31:22,175 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:31:22,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:31:22,180 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:31:22,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:31:22,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:31:22,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:22,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:31:22,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-02-04 17:31:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:23,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:23,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-04 17:31:23,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 17:31:23,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 17:31:23,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=2550, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 17:31:23,278 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 52 states. [2018-02-04 17:31:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:26,649 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2018-02-04 17:31:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:31:26,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 224 [2018-02-04 17:31:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:26,651 INFO L225 Difference]: With dead ends: 232 [2018-02-04 17:31:26,651 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 17:31:26,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=310, Invalid=9590, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 17:31:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 17:31:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-02-04 17:31:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 17:31:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-02-04 17:31:26,654 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2018-02-04 17:31:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:26,654 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-02-04 17:31:26,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 17:31:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-02-04 17:31:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-02-04 17:31:26,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:26,655 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:26,656 INFO L371 AbstractCegarLoop]: === Iteration 57 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:26,656 INFO L82 PathProgramCache]: Analyzing trace with hash 269640961, now seen corresponding path program 42 times [2018-02-04 17:31:26,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:26,656 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:26,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:26,656 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:26,657 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:26,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:26,706 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:26,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:26,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:26,707 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:31:27,536 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:31:27,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:27,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:27,581 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:31:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:27,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:31:27,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:27,589 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:31:27,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:27,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:27,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:27,600 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:31:27,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:27,614 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:31:27,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:27,622 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:31:27,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:31:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:28,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:28,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-02-04 17:31:28,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:31:28,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:31:28,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:31:28,802 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 53 states. [2018-02-04 17:31:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:32,428 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-02-04 17:31:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:31:32,429 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 229 [2018-02-04 17:31:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:32,429 INFO L225 Difference]: With dead ends: 237 [2018-02-04 17:31:32,429 INFO L226 Difference]: Without dead ends: 237 [2018-02-04 17:31:32,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=316, Invalid=9986, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 17:31:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-04 17:31:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-02-04 17:31:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 17:31:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-02-04 17:31:32,431 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 229 [2018-02-04 17:31:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:32,432 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-02-04 17:31:32,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:31:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-02-04 17:31:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-02-04 17:31:32,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:32,433 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:32,433 INFO L371 AbstractCegarLoop]: === Iteration 58 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2083844888, now seen corresponding path program 43 times [2018-02-04 17:31:32,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:32,433 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:32,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:32,434 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:32,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:32,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:32,490 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:32,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:32,490 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:32,491 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:31:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:33,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:33,049 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:31:33,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:33,054 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:31:33,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:33,057 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:31:33,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:33,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:33,068 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:31:33,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:33,073 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:31:33,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:33,076 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:31:33,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:34,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:34,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-02-04 17:31:34,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:31:34,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:31:34,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:31:34,314 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 55 states. [2018-02-04 17:31:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:38,005 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-02-04 17:31:38,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:31:38,006 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-02-04 17:31:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:38,006 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:31:38,006 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:31:38,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-02-04 17:31:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:31:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-02-04 17:31:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-04 17:31:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-02-04 17:31:38,009 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 234 [2018-02-04 17:31:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:38,009 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-02-04 17:31:38,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:31:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-02-04 17:31:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-02-04 17:31:38,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:38,011 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:38,011 INFO L371 AbstractCegarLoop]: === Iteration 59 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:38,011 INFO L82 PathProgramCache]: Analyzing trace with hash 647118177, now seen corresponding path program 44 times [2018-02-04 17:31:38,011 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:38,011 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:38,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:38,012 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:31:38,012 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:38,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:38,066 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:38,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:38,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:38,066 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:31:38,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:31:38,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:38,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:38,852 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:31:38,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:38,856 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:31:38,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:38,859 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:31:38,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:38,870 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:31:38,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:38,874 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:31:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:38,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:31:38,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:40,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:40,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-04 17:31:40,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 17:31:40,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 17:31:40,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 17:31:40,146 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 56 states. [2018-02-04 17:31:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:44,041 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-02-04 17:31:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:31:44,041 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 239 [2018-02-04 17:31:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:44,042 INFO L225 Difference]: With dead ends: 247 [2018-02-04 17:31:44,042 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 17:31:44,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=337, Invalid=11219, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 17:31:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 17:31:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-02-04 17:31:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-04 17:31:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-02-04 17:31:44,045 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 239 [2018-02-04 17:31:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:44,045 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-02-04 17:31:44,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 17:31:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-02-04 17:31:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-02-04 17:31:44,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:44,046 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:44,046 INFO L371 AbstractCegarLoop]: === Iteration 60 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash -549228408, now seen corresponding path program 45 times [2018-02-04 17:31:44,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:44,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:44,047 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:44,047 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:44,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:44,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:44,111 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:44,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:44,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:44,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:31:44,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:31:44,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:44,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:44,983 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:31:44,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:44,986 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:31:44,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:31:44,998 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:31:44,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:31:45,003 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:31:45,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-02-04 17:31:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:46,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:46,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 17:31:46,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:31:46,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:31:46,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:31:46,194 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 57 states. [2018-02-04 17:31:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:49,948 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-02-04 17:31:49,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:31:49,948 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [2018-02-04 17:31:49,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:49,949 INFO L225 Difference]: With dead ends: 252 [2018-02-04 17:31:49,949 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 17:31:49,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=343, Invalid=11647, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 17:31:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 17:31:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-02-04 17:31:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 17:31:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-02-04 17:31:49,951 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 244 [2018-02-04 17:31:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:49,952 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-02-04 17:31:49,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:31:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-02-04 17:31:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-04 17:31:49,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:49,953 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:49,953 INFO L371 AbstractCegarLoop]: === Iteration 61 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 921116097, now seen corresponding path program 46 times [2018-02-04 17:31:49,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:49,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:49,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:49,954 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:49,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:50,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:50,030 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:50,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:50,030 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:50,030 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:31:50,677 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:31:50,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:50,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:50,729 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:31:50,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:50,733 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:31:50,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:50,736 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:31:50,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:50,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:50,747 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:31:50,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:50,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:50,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:50,753 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:31:50,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:50,757 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:31:50,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:31:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:31:52,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:31:52,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 17:31:52,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:31:52,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:31:52,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:31:52,119 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 58 states. [2018-02-04 17:31:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:31:56,324 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-02-04 17:31:56,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:31:56,324 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 249 [2018-02-04 17:31:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:31:56,324 INFO L225 Difference]: With dead ends: 257 [2018-02-04 17:31:56,324 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 17:31:56,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=349, Invalid=12083, Unknown=0, NotChecked=0, Total=12432 [2018-02-04 17:31:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 17:31:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-02-04 17:31:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-04 17:31:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-02-04 17:31:56,326 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 249 [2018-02-04 17:31:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:31:56,327 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-02-04 17:31:56,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:31:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-02-04 17:31:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-02-04 17:31:56,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:31:56,328 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:31:56,328 INFO L371 AbstractCegarLoop]: === Iteration 62 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:31:56,328 INFO L82 PathProgramCache]: Analyzing trace with hash -993276888, now seen corresponding path program 47 times [2018-02-04 17:31:56,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:31:56,328 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:31:56,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:56,329 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:31:56,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:31:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:31:56,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:31:56,376 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:31:56,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:31:56,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:31:56,376 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:31:58,564 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:31:58,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:31:58,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:31:58,628 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:31:58,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:58,635 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:31:58,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:58,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:31:58,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:31:58,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:58,650 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:31:58,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:58,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:31:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 17:31:58,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:31:58,662 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:31:58,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-02-04 17:32:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:00,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:00,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-02-04 17:32:00,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 17:32:00,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 17:32:00,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 17:32:00,004 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 57 states. [2018-02-04 17:32:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:04,363 INFO L93 Difference]: Finished difference Result 262 states and 263 transitions. [2018-02-04 17:32:04,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:32:04,363 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 254 [2018-02-04 17:32:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:04,364 INFO L225 Difference]: With dead ends: 262 [2018-02-04 17:32:04,364 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 17:32:04,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=337, Invalid=11653, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 17:32:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 17:32:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-02-04 17:32:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 17:32:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-02-04 17:32:04,366 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 254 [2018-02-04 17:32:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:04,367 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-02-04 17:32:04,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 17:32:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-02-04 17:32:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-04 17:32:04,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:04,367 INFO L351 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:04,367 INFO L371 AbstractCegarLoop]: === Iteration 63 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -530119135, now seen corresponding path program 48 times [2018-02-04 17:32:04,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:04,368 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:04,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:04,368 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:04,368 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:04,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:04,419 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:04,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:04,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:04,420 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:32:06,103 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:32:06,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:06,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:06,182 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:32:06,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:06,185 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:32:06,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-04 17:32:06,198 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:32:06,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:06,203 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:32:06,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-04 17:32:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:07,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:07,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-04 17:32:07,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:32:07,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:32:07,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:32:07,565 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 59 states. [2018-02-04 17:32:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:11,912 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-02-04 17:32:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:32:11,913 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-02-04 17:32:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:11,913 INFO L225 Difference]: With dead ends: 267 [2018-02-04 17:32:11,914 INFO L226 Difference]: Without dead ends: 267 [2018-02-04 17:32:11,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-02-04 17:32:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-04 17:32:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-02-04 17:32:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-04 17:32:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-02-04 17:32:11,917 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 259 [2018-02-04 17:32:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:11,917 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-02-04 17:32:11,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:32:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-02-04 17:32:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-02-04 17:32:11,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:11,918 INFO L351 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:11,919 INFO L371 AbstractCegarLoop]: === Iteration 64 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1160896568, now seen corresponding path program 49 times [2018-02-04 17:32:11,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:11,919 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:11,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:11,920 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:11,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:12,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:12,013 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:12,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:12,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:12,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:12,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:12,373 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:32:12,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:12,377 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:32:12,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:12,380 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:32:12,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:32:12,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:12,389 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:32:12,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:12,395 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:12,395 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:12,395 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:32:12,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:12,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:32:12,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:32:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:13,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:13,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 17:32:13,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:32:13,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:32:13,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:32:13,900 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 61 states. [2018-02-04 17:32:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:18,593 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-02-04 17:32:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:32:18,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 264 [2018-02-04 17:32:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:18,593 INFO L225 Difference]: With dead ends: 272 [2018-02-04 17:32:18,593 INFO L226 Difference]: Without dead ends: 272 [2018-02-04 17:32:18,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=367, Invalid=13439, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 17:32:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-04 17:32:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-02-04 17:32:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-04 17:32:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-02-04 17:32:18,596 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 264 [2018-02-04 17:32:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:18,596 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-02-04 17:32:18,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:32:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-02-04 17:32:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-02-04 17:32:18,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:18,597 INFO L351 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:18,597 INFO L371 AbstractCegarLoop]: === Iteration 65 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 250082945, now seen corresponding path program 50 times [2018-02-04 17:32:18,598 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:18,598 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:18,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:18,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:18,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:18,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:18,651 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:18,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:18,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:18,652 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:32:20,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:32:20,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:20,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:20,248 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:32:20,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:20,252 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:32:20,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:20,256 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:32:20,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:32:20,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:20,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:20,266 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:32:20,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:20,271 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:32:20,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:20,274 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:32:20,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:32:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:21,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:21,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-02-04 17:32:21,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 17:32:21,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 17:32:21,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3659, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 17:32:21,829 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 62 states. [2018-02-04 17:32:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:26,778 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-02-04 17:32:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:32:26,778 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 269 [2018-02-04 17:32:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:26,779 INFO L225 Difference]: With dead ends: 277 [2018-02-04 17:32:26,779 INFO L226 Difference]: Without dead ends: 277 [2018-02-04 17:32:26,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=373, Invalid=13907, Unknown=0, NotChecked=0, Total=14280 [2018-02-04 17:32:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-04 17:32:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-02-04 17:32:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-04 17:32:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-02-04 17:32:26,781 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2018-02-04 17:32:26,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:26,781 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-02-04 17:32:26,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 17:32:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-02-04 17:32:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-02-04 17:32:26,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:26,782 INFO L351 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:26,782 INFO L371 AbstractCegarLoop]: === Iteration 66 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -885757080, now seen corresponding path program 51 times [2018-02-04 17:32:26,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:26,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:26,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,783 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:26,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:26,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:26,842 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:26,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:26,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:26,843 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:32:28,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:32:28,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:28,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:28,094 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:32:28,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,098 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:32:28,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:32:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:28,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:28,121 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:32:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 17:32:28,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:28,133 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:32:28,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:32:29,525 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:32:29,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:29,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:29,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-02-04 17:32:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:29,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:29,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-04 17:32:29,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 17:32:29,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 17:32:29,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 17:32:29,868 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 63 states. [2018-02-04 17:32:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:35,344 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-02-04 17:32:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 17:32:35,344 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 274 [2018-02-04 17:32:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:35,345 INFO L225 Difference]: With dead ends: 282 [2018-02-04 17:32:35,345 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 17:32:35,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=379, Invalid=14383, Unknown=0, NotChecked=0, Total=14762 [2018-02-04 17:32:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 17:32:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-02-04 17:32:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-04 17:32:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-02-04 17:32:35,348 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2018-02-04 17:32:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:35,348 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-02-04 17:32:35,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 17:32:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-02-04 17:32:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-04 17:32:35,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:35,350 INFO L351 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:35,350 INFO L371 AbstractCegarLoop]: === Iteration 67 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1522527969, now seen corresponding path program 52 times [2018-02-04 17:32:35,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:35,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:35,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:35,351 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:35,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:35,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:35,449 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:35,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:35,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:35,450 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:32:35,838 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:32:35,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:35,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:35,934 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:32:35,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:35,939 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:32:35,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:35,943 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:32:35,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-04 17:32:35,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:35,954 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:32:35,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:35,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:35,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:35,961 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:32:35,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:35,963 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:32:35,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-04 17:32:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:32:37,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:32:37,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-02-04 17:32:37,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-02-04 17:32:37,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-02-04 17:32:37,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 17:32:37,796 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 64 states. Received shutdown request... [2018-02-04 17:32:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:32:42,760 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:32:42,764 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:32:42,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:32:42 BoogieIcfgContainer [2018-02-04 17:32:42,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:32:42,765 INFO L168 Benchmark]: Toolchain (without parser) took 179971.04 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 360.7 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 613.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:42,765 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:32:42,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.97 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:42,766 INFO L168 Benchmark]: Boogie Preprocessor took 28.71 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:42,766 INFO L168 Benchmark]: RCFGBuilder took 175.38 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 330.2 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:32:42,766 INFO L168 Benchmark]: TraceAbstraction took 179605.53 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 328.9 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 581.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:42,768 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.97 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.71 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.38 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 330.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 179605.53 ms. Allocated memory was 402.7 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 328.9 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 581.6 MB. 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 (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (280states) and interpolant automaton (currently 56 states, 64 states before enhancement), while ReachableStatesComputation was computing reachable states (249 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. TIMEOUT Result, 179.5s OverallTime, 67 OverallIterations, 53 TraceHistogramMax, 112.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3837 SDtfs, 7602 SDslu, 135289 SDs, 0 SdLazy, 194346 SolverSat, 1742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9889 GetRequests, 6083 SyntacticMatches, 5 SemanticMatches, 3801 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38272 ImplicationChecksByTransitivity, 79.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=66, 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, 66 MinimizatonAttempts, 195 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 21.5s SatisfiabilityAnalysisTime, 44.7s InterpolantComputationTime, 16279 NumberOfCodeBlocks, 16269 NumberOfCodeBlocksAsserted, 807 NumberOfCheckSat, 8148 ConstructedInterpolants, 77 QuantifiedInterpolants, 24485929 SizeOfPredicates, 656 NumberOfNonLiveVariables, 34772 ConjunctsInSsa, 10404 ConjunctsInUnsatCore, 68 InterpolantComputations, 11 PerfectInterpolantSequences, 13/121338 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/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-32-42-774.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-32-42-774.csv Completed graceful shutdown