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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:51:29,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:51:29,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:51:29,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:51:29,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:51:29,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:51:29,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:51:29,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:51:29,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:51:29,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:51:29,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:51:29,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:51:29,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:51:29,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:51:29,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:51:29,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:51:29,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:51:29,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:51:29,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:51:29,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:51:29,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:51:29,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:51:29,407 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:51:29,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:51:29,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:51:29,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:51:29,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:51:29,410 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:51:29,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:51:29,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:51:29,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:51:29,411 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:51:29,421 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:51:29,421 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:51:29,422 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:51:29,422 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:51:29,422 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:51:29,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:51:29,422 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:51:29,423 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:51:29,424 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:51:29,424 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:51:29,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:51:29,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:51:29,425 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:51:29,425 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:51:29,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:51:29,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:51:29,464 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:51:29,467 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:51:29,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:51:29,469 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:51:29,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:29,653 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:51:29,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:51:29,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:29,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:51:29,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:51:29,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@131cb6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29, skipping insertion in model container [2018-02-03 22:51:29,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,676 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:29,705 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:29,788 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:29,800 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:29,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29 WrapperNode [2018-02-03 22:51:29,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:29,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:51:29,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:51:29,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:51:29,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (1/1) ... [2018-02-03 22:51:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:51:29,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:51:29,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:51:29,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:51:29,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (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-03 22:51:29,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:51:29,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:51:29,864 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-02-03 22:51:29,864 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:51:29,864 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:51:29,864 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:51:29,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:51:29,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:51:30,001 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:51:30,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:30 BoogieIcfgContainer [2018-02-03 22:51:30,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:51:30,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:51:30,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:51:30,004 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:51:30,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:51:29" (1/3) ... [2018-02-03 22:51:30,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276f480b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:30, skipping insertion in model container [2018-02-03 22:51:30,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:29" (2/3) ... [2018-02-03 22:51:30,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276f480b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:30, skipping insertion in model container [2018-02-03 22:51:30,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:30" (3/3) ... [2018-02-03 22:51:30,006 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:30,012 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:51:30,016 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-03 22:51:30,041 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:51:30,041 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:51:30,041 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:51:30,041 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:51:30,041 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:51:30,041 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:51:30,041 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:51:30,042 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:51:30,042 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:51:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-03 22:51:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:51:30,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,062 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,062 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-02-03 22:51:30,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,258 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-03 22:51:30,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:51:30,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:30,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:30,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:30,326 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-03 22:51:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:30,387 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-03 22:51:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:30,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:51:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:30,394 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:51:30,394 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:51:30,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:51:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:51:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:51:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-03 22:51:30,422 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-02-03 22:51:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:30,423 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-03 22:51:30,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-03 22:51:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:51:30,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,424 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,424 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-02-03 22:51:30,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,511 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-03 22:51:30,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:30,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:30,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:30,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:30,513 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-02-03 22:51:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:30,576 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-03 22:51:30,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:30,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:51:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:30,577 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:51:30,577 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:51:30,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:51:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:51:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:51:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:51:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-03 22:51:30,583 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-02-03 22:51:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:30,583 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-03 22:51:30,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-03 22:51:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:51:30,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,584 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,585 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-02-03 22:51:30,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,617 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-03 22:51:30,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:51:30,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:30,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:30,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:30,618 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-03 22:51:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:30,663 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-03 22:51:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:30,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:51:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:30,663 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:51:30,664 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:51:30,664 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-03 22:51:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:51:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:51:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:51:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-02-03 22:51:30,666 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-02-03 22:51:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:30,667 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-02-03 22:51:30,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-02-03 22:51:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:51:30,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,667 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,667 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-02-03 22:51:30,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,727 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-03 22:51:30,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:30,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:30,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:30,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:30,729 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-02-03 22:51:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:30,784 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-02-03 22:51:30,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:30,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:51:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:30,785 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:51:30,786 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:51:30,786 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-03 22:51:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:51:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:51:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:51:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-03 22:51:30,789 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-02-03 22:51:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:30,789 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-03 22:51:30,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-03 22:51:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:51:30,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,790 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-02-03 22:51:30,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:30,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:30,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:30,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:30,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:30,835 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-02-03 22:51:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:30,879 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-03 22:51:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:51:30,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-03 22:51:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:30,880 INFO L225 Difference]: With dead ends: 47 [2018-02-03 22:51:30,880 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:51:30,881 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-03 22:51:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:51:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:51:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:51:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-03 22:51:30,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-03 22:51:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:30,885 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-03 22:51:30,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-03 22:51:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:51:30,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:30,885 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:30,886 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-02-03 22:51:30,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:30,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:30,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:30,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:30,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:30,969 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-03 22:51:30,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:30,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:51:30,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:51:30,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:51:30,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:30,970 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-02-03 22:51:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,037 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-03 22:51:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:51:31,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-03 22:51:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,039 INFO L225 Difference]: With dead ends: 62 [2018-02-03 22:51:31,039 INFO L226 Difference]: Without dead ends: 62 [2018-02-03 22:51:31,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-03 22:51:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-03 22:51:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:51:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-03 22:51:31,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-02-03 22:51:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,043 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-03 22:51:31,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:51:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-03 22:51:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:51:31,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,043 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] [2018-02-03 22:51:31,043 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-02-03 22:51:31,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,073 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-03 22:51:31,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:31,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:31,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:31,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:31,074 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-03 22:51:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,137 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-03 22:51:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:31,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-03 22:51:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,139 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:51:31,139 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:51:31,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:51:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:51:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:51:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-03 22:51:31,142 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-02-03 22:51:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,142 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-03 22:51:31,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-03 22:51:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:51:31,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,143 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] [2018-02-03 22:51:31,143 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-02-03 22:51:31,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,227 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-03 22:51:31,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:51:31,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:51:31,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:51:31,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:51:31,228 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-03 22:51:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,335 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-03 22:51:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:51:31,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-03 22:51:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,336 INFO L225 Difference]: With dead ends: 62 [2018-02-03 22:51:31,336 INFO L226 Difference]: Without dead ends: 62 [2018-02-03 22:51:31,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-03 22:51:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-03 22:51:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:51:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-03 22:51:31,340 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-02-03 22:51:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,340 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-03 22:51:31,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:51:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-03 22:51:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:51:31,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,341 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] [2018-02-03 22:51:31,341 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-02-03 22:51:31,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,343 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,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-03 22:51:31,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:31,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:31,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:31,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:31,380 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-03 22:51:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,421 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-03 22:51:31,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:31,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-03 22:51:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,422 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:51:31,423 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:51:31,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:51:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:51:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:51:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-03 22:51:31,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-03 22:51:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,426 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-03 22:51:31,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-03 22:51:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:51:31,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,427 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] [2018-02-03 22:51:31,427 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,427 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-02-03 22:51:31,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,428 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,428 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,512 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-03 22:51:31,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:51:31,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:51:31,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:51:31,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:51:31,513 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-03 22:51:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,652 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-02-03 22:51:31,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:51:31,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-03 22:51:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,653 INFO L225 Difference]: With dead ends: 63 [2018-02-03 22:51:31,653 INFO L226 Difference]: Without dead ends: 63 [2018-02-03 22:51:31,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:51:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-03 22:51:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-02-03 22:51:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:51:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-03 22:51:31,657 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-03 22:51:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,657 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-03 22:51:31,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:51:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-03 22:51:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:51:31,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,658 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] [2018-02-03 22:51:31,658 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-02-03 22:51:31,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,692 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-03 22:51:31,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:31,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:31,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:31,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:31,693 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-03 22:51:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,755 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-03 22:51:31,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:31,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-03 22:51:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,757 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:51:31,757 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:51:31,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:51:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:51:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:51:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-03 22:51:31,760 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-03 22:51:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,760 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-03 22:51:31,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-03 22:51:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:51:31,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,761 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] [2018-02-03 22:51:31,761 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-02-03 22:51:31,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:31,830 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-03 22:51:31,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:31,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:51:31,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:51:31,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:51:31,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:51:31,831 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-03 22:51:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:31,899 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-03 22:51:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:51:31,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-03 22:51:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:31,900 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:51:31,900 INFO L226 Difference]: Without dead ends: 59 [2018-02-03 22:51:31,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-03 22:51:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-03 22:51:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:51:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-02-03 22:51:31,902 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-02-03 22:51:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:31,902 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-02-03 22:51:31,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:51:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-02-03 22:51:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:51:31,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:31,903 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] [2018-02-03 22:51:31,903 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-02-03 22:51:31,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:31,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:31,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:31,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:31,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:32,233 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-03 22:51:32,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:32,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 22:51:32,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:51:32,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:51:32,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:32,234 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-02-03 22:51:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:32,457 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2018-02-03 22:51:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:51:32,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-03 22:51:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:32,458 INFO L225 Difference]: With dead ends: 132 [2018-02-03 22:51:32,459 INFO L226 Difference]: Without dead ends: 132 [2018-02-03 22:51:32,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-03 22:51:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-03 22:51:32,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-02-03 22:51:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-03 22:51:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-02-03 22:51:32,464 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 26 [2018-02-03 22:51:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:32,464 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-02-03 22:51:32,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:51:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-02-03 22:51:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:51:32,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:32,466 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, 1, 1] [2018-02-03 22:51:32,467 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:32,467 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-02-03 22:51:32,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:32,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:32,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:32,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:32,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 22:51:32,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:32,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:51:32,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:32,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:32,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:32,522 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 6 states. [2018-02-03 22:51:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:32,547 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-02-03 22:51:32,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:32,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-03 22:51:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:32,549 INFO L225 Difference]: With dead ends: 99 [2018-02-03 22:51:32,549 INFO L226 Difference]: Without dead ends: 99 [2018-02-03 22:51:32,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:51:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-03 22:51:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-03 22:51:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-03 22:51:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-02-03 22:51:32,554 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2018-02-03 22:51:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:32,554 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-02-03 22:51:32,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-02-03 22:51:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:51:32,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:32,555 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] [2018-02-03 22:51:32,555 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 717809756, now seen corresponding path program 1 times [2018-02-03 22:51:32,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:32,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:32,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:32,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:32,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:32,701 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-03 22:51:32,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:32,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:51:32,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:51:32,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:51:32,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:51:32,703 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 11 states. [2018-02-03 22:51:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:32,843 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-02-03 22:51:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:51:32,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-03 22:51:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:32,844 INFO L225 Difference]: With dead ends: 121 [2018-02-03 22:51:32,844 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 22:51:32,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:51:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 22:51:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 62. [2018-02-03 22:51:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 22:51:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-02-03 22:51:32,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2018-02-03 22:51:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:32,846 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-02-03 22:51:32,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:51:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-02-03 22:51:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 22:51:32,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:32,847 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:32,847 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-02-03 22:51:32,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:32,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:32,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:32,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:32,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:32,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:32,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:51:32,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:51:32,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:51:32,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:32,972 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 10 states. [2018-02-03 22:51:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:33,111 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-03 22:51:33,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:51:33,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-03 22:51:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:33,112 INFO L225 Difference]: With dead ends: 105 [2018-02-03 22:51:33,112 INFO L226 Difference]: Without dead ends: 105 [2018-02-03 22:51:33,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:51:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-03 22:51:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-02-03 22:51:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-03 22:51:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-02-03 22:51:33,116 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 27 [2018-02-03 22:51:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:33,116 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-02-03 22:51:33,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:51:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-02-03 22:51:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 22:51:33,117 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:33,117 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:33,117 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-02-03 22:51:33,118 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:33,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:33,118 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:33,118 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:33,119 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:33,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:33,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:33,252 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:33,258 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:33,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:51:33,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:51:33,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:33,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:33,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:33,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:51:33,470 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-03 22:51:33,478 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-03 22:51:33,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:33,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:33,494 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-03 22:51:33,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:51:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:33,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:33,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-03 22:51:33,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 22:51:33,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 22:51:33,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:51:33,577 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 17 states. [2018-02-03 22:51:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:36,951 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2018-02-03 22:51:36,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:51:36,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-02-03 22:51:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:36,951 INFO L225 Difference]: With dead ends: 134 [2018-02-03 22:51:36,952 INFO L226 Difference]: Without dead ends: 134 [2018-02-03 22:51:36,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:51:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-03 22:51:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-02-03 22:51:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 22:51:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-02-03 22:51:36,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 27 [2018-02-03 22:51:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:36,956 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-02-03 22:51:36,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 22:51:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-02-03 22:51:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:51:36,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:36,957 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] [2018-02-03 22:51:36,957 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1893257598, now seen corresponding path program 1 times [2018-02-03 22:51:36,957 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:36,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:36,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:36,958 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:36,958 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:36,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:37,011 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-03 22:51:37,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:37,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:37,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:37,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:37,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:37,012 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 5 states. [2018-02-03 22:51:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:37,018 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-02-03 22:51:37,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:51:37,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-03 22:51:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:37,019 INFO L225 Difference]: With dead ends: 95 [2018-02-03 22:51:37,019 INFO L226 Difference]: Without dead ends: 95 [2018-02-03 22:51:37,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-03 22:51:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-03 22:51:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 22:51:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-02-03 22:51:37,022 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 28 [2018-02-03 22:51:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:37,022 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-02-03 22:51:37,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-02-03 22:51:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:51:37,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:37,023 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:37,023 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-02-03 22:51:37,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:37,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:37,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:37,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:37,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:37,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:37,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:37,154 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:37,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:37,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:37,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:37,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:37,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:37,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:37,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:37,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:37,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:37,220 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-03 22:51:37,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:37,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:37,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:37,233 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-03 22:51:37,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:37,236 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-03 22:51:37,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:51:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:37,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:37,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-02-03 22:51:37,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:51:37,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:51:37,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:51:37,353 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-02-03 22:51:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:37,746 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-02-03 22:51:37,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:51:37,746 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-03 22:51:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:37,746 INFO L225 Difference]: With dead ends: 112 [2018-02-03 22:51:37,746 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:51:37,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-02-03 22:51:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:51:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-02-03 22:51:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-03 22:51:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-03 22:51:37,749 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-03 22:51:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:37,749 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-03 22:51:37,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:51:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-03 22:51:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:51:37,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:37,750 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-03 22:51:37,750 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-02-03 22:51:37,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:37,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:37,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:37,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:37,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:37,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:37,911 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-03 22:51:37,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:37,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:51:37,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:51:37,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:51:37,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:37,912 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2018-02-03 22:51:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:38,079 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-03 22:51:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:51:38,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-03 22:51:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:38,080 INFO L225 Difference]: With dead ends: 113 [2018-02-03 22:51:38,080 INFO L226 Difference]: Without dead ends: 109 [2018-02-03 22:51:38,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-02-03 22:51:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-03 22:51:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-02-03 22:51:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 22:51:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-03 22:51:38,083 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-02-03 22:51:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:38,084 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-03 22:51:38,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:51:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-03 22:51:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:51:38,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:38,084 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, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:38,084 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-02-03 22:51:38,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:38,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:38,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,086 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:38,086 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:38,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:38,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:38,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-03 22:51:38,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:51:38,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:51:38,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:51:38,242 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-02-03 22:51:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:38,436 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-03 22:51:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:51:38,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-03 22:51:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:38,437 INFO L225 Difference]: With dead ends: 112 [2018-02-03 22:51:38,437 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:51:38,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:51:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:51:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-03 22:51:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-03 22:51:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-02-03 22:51:38,440 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-02-03 22:51:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:38,440 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-02-03 22:51:38,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:51:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-02-03 22:51:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:51:38,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:38,441 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:38,441 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-02-03 22:51:38,441 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:38,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:38,442 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,442 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:38,442 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:38,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:38,500 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-03 22:51:38,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:38,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:38,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:38,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:38,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:38,501 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-02-03 22:51:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:38,611 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-02-03 22:51:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:38,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-03 22:51:38,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:38,613 INFO L225 Difference]: With dead ends: 91 [2018-02-03 22:51:38,613 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:51:38,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:51:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:51:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:51:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-03 22:51:38,615 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2018-02-03 22:51:38,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:38,615 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-03 22:51:38,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-03 22:51:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:51:38,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:38,615 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, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:38,615 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:38,616 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-02-03 22:51:38,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:38,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:38,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:38,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:38,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:38,793 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-03 22:51:38,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:38,793 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:38,798 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:38,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:38,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:38,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:51:38,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:38,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:38,832 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-03 22:51:38,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:51:38,859 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 14 treesize of output 11 [2018-02-03 22:51:38,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:51:38,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:38,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:51:38,955 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 22 treesize of output 23 [2018-02-03 22:51:38,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:38,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:38,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:38,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:51:39,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-02-03 22:51:39,043 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-03 22:51:39,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:39,051 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-03 22:51:39,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:39,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:39,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:39,063 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-02-03 22:51:39,093 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-03 22:51:39,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:39,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-02-03 22:51:39,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:51:39,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:51:39,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:51:39,111 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 23 states. [2018-02-03 22:51:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:39,899 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-03 22:51:39,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:51:39,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-03 22:51:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:39,899 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:51:39,900 INFO L226 Difference]: Without dead ends: 64 [2018-02-03 22:51:39,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-03 22:51:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-03 22:51:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 22:51:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-03 22:51:39,901 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2018-02-03 22:51:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:39,901 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-03 22:51:39,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:51:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-03 22:51:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:51:39,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:39,901 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:39,901 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-02-03 22:51:39,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:39,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:39,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:39,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:39,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:39,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:40,019 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-03 22:51:40,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:40,019 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:40,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:40,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:40,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:51:40,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:51:40,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:40,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:40,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:40,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:51:40,148 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-03 22:51:40,152 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-03 22:51:40,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:40,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:40,160 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-03 22:51:40,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:51:40,185 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-03 22:51:40,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:40,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-03 22:51:40,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 22:51:40,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 22:51:40,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:51:40,203 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 17 states. [2018-02-03 22:51:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:40,554 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-03 22:51:40,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:51:40,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-02-03 22:51:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:40,555 INFO L225 Difference]: With dead ends: 67 [2018-02-03 22:51:40,555 INFO L226 Difference]: Without dead ends: 67 [2018-02-03 22:51:40,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:51:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-03 22:51:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-03 22:51:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 22:51:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-03 22:51:40,557 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2018-02-03 22:51:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:40,557 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-03 22:51:40,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 22:51:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-03 22:51:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:51:40,558 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:40,558 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:40,558 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1093780658, now seen corresponding path program 1 times [2018-02-03 22:51:40,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:40,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:40,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:40,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:40,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:40,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:40,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:40,695 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:40,700 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:40,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 22:51:40,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:51:40,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2018-02-03 22:51:40,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 22:51:40,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 22:51:40,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:51:40,750 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 15 states. [2018-02-03 22:51:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:41,108 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-02-03 22:51:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 22:51:41,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-03 22:51:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:41,109 INFO L225 Difference]: With dead ends: 80 [2018-02-03 22:51:41,109 INFO L226 Difference]: Without dead ends: 78 [2018-02-03 22:51:41,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:51:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-03 22:51:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-02-03 22:51:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-03 22:51:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-03 22:51:41,110 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-03 22:51:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:41,110 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-03 22:51:41,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 22:51:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-03 22:51:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:51:41,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:41,111 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:41,111 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-02-03 22:51:41,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:41,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:41,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:41,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:41,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:41,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:41,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:41,365 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:41,379 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:41,399 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:41,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:41,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:41,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:41,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:51:41,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:41,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:41,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:41,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-03 22:51:41,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:51:41,451 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-03 22:51:41,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:41,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:41,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:51:41,639 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-03 22:51:41,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:41,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:41,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:41,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-03 22:51:41,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-03 22:51:41,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:51:41,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:41,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:41,735 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-03 22:51:41,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-03 22:51:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:41,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:41,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-03 22:51:41,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:51:41,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:51:41,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:51:41,800 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 26 states. [2018-02-03 22:51:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:42,556 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-03 22:51:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:51:42,556 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-03 22:51:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:42,557 INFO L225 Difference]: With dead ends: 74 [2018-02-03 22:51:42,557 INFO L226 Difference]: Without dead ends: 74 [2018-02-03 22:51:42,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:51:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-03 22:51:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-02-03 22:51:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-03 22:51:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-03 22:51:42,558 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 33 [2018-02-03 22:51:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:42,558 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-03 22:51:42,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:51:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-03 22:51:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:51:42,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:42,559 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:42,559 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-02-03 22:51:42,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:42,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:42,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:42,560 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:42,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:42,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:43,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:43,002 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:43,007 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:43,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:43,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:43,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:43,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:43,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:51:43,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:43,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:43,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:43,052 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-03 22:51:43,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:51:43,084 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-03 22:51:43,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 13 treesize of output 12 [2018-02-03 22:51:43,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:43,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:51:43,158 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-03 22:51:43,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:43,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:43,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-02-03 22:51:43,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-02-03 22:51:43,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:51:43,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:43,303 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-03 22:51:43,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:43,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:43,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:43,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-03 22:51:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:43,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:43,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-02-03 22:51:43,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 22:51:43,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 22:51:43,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-02-03 22:51:43,364 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 32 states. [2018-02-03 22:51:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:44,085 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-03 22:51:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:51:44,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-02-03 22:51:44,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:44,086 INFO L225 Difference]: With dead ends: 72 [2018-02-03 22:51:44,086 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:51:44,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:51:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:51:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-03 22:51:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 22:51:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-03 22:51:44,088 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2018-02-03 22:51:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:44,088 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-03 22:51:44,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 22:51:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-03 22:51:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:51:44,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:44,089 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:44,089 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-02-03 22:51:44,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:44,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:44,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:44,090 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:44,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:44,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:44,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:44,251 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:44,257 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:44,272 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:44,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:44,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:44,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:44,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:44,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:44,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:44,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:44,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:44,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:44,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:44,288 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-03 22:51:44,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:44,292 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-03 22:51:44,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:44,296 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-03 22:51:44,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:51:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:44,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:44,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-02-03 22:51:44,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-03 22:51:44,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-03 22:51:44,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:51:44,449 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2018-02-03 22:51:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:44,796 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-03 22:51:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:51:44,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-02-03 22:51:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:44,797 INFO L225 Difference]: With dead ends: 65 [2018-02-03 22:51:44,797 INFO L226 Difference]: Without dead ends: 65 [2018-02-03 22:51:44,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-02-03 22:51:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-03 22:51:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-02-03 22:51:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-03 22:51:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-03 22:51:44,798 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-02-03 22:51:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:44,798 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-03 22:51:44,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-03 22:51:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-03 22:51:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:51:44,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:44,798 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:44,799 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-02-03 22:51:44,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:44,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:44,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:44,799 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:44,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:44,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:45,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:45,104 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:45,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:45,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:45,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:45,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:51:45,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:45,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:45,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:45,150 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-03 22:51:45,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:51:45,170 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-03 22:51:45,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:45,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-03 22:51:45,267 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-03 22:51:45,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:45,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,277 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-03 22:51:45,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-02-03 22:51:45,301 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-03 22:51:45,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:45,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:45,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-03 22:51:45,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-03 22:51:45,397 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-03 22:51:45,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:45,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-03 22:51:45,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:45,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:45,418 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-03 22:51:45,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-02-03 22:51:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:45,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:45,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-02-03 22:51:45,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 22:51:45,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 22:51:45,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-03 22:51:45,506 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 27 states. [2018-02-03 22:51:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:46,224 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-03 22:51:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 22:51:46,224 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-03 22:51:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:46,225 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:51:46,225 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:51:46,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=1915, Unknown=0, NotChecked=0, Total=2162 [2018-02-03 22:51:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:51:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:51:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:51:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-03 22:51:46,226 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2018-02-03 22:51:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:46,226 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-03 22:51:46,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 22:51:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-03 22:51:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:51:46,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:46,227 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:46,227 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-02-03 22:51:46,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:46,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:46,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:46,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:46,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:46,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:46,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:46,565 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:46,572 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:46,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:46,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:46,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:46,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:46,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:51:46,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:46,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:46,615 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-03 22:51:46,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:51:46,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:51:46,656 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-03 22:51:46,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:46,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:46,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:51:46,810 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-03 22:51:46,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:46,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:46,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:46,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-03 22:51:46,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-03 22:51:46,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:51:46,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:46,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:46,892 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-03 22:51:46,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-03 22:51:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:46,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:46,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-03 22:51:46,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:51:46,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:51:46,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:51:46,940 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-02-03 22:51:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:47,501 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-02-03 22:51:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:51:47,502 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-02-03 22:51:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:47,502 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:51:47,502 INFO L226 Difference]: Without dead ends: 45 [2018-02-03 22:51:47,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 22:51:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-03 22:51:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-03 22:51:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-03 22:51:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-03 22:51:47,503 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-02-03 22:51:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:47,504 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-03 22:51:47,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:51:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-03 22:51:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 22:51:47,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:47,504 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:47,504 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-03 22:51:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-02-03 22:51:47,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:47,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:47,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:47,505 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:51:47,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:47,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 22:51:47,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:47,711 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:51:47,718 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:51:47,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:51:47,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:47,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:47,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:47,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:47,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03 22:51:47,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:47,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:47,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:51:47,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:47,788 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-03 22:51:47,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:47,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:47,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:47,799 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-03 22:51:47,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:47,804 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-03 22:51:47,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-03 22:51:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:48,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:48,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-03 22:51:48,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 22:51:48,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 22:51:48,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-03 22:51:48,076 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 27 states. [2018-02-03 22:51:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:48,918 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-03 22:51:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-03 22:51:48,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-02-03 22:51:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:48,918 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:51:48,918 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:51:48,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=2003, Unknown=0, NotChecked=0, Total=2256 [2018-02-03 22:51:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:51:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:51:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:51:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:51:48,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-02-03 22:51:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:48,920 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:51:48,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 22:51:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:51:48,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:51:48,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:51:48 BoogieIcfgContainer [2018-02-03 22:51:48,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:51:48,924 INFO L168 Benchmark]: Toolchain (without parser) took 19270.00 ms. Allocated memory was 406.3 MB in the beginning and 842.5 MB in the end (delta: 436.2 MB). Free memory was 364.5 MB in the beginning and 713.7 MB in the end (delta: -349.2 MB). Peak memory consumption was 87.0 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:48,924 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:51:48,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.53 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 352.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:48,925 INFO L168 Benchmark]: Boogie Preprocessor took 23.16 ms. Allocated memory is still 406.3 MB. Free memory was 352.6 MB in the beginning and 351.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:48,925 INFO L168 Benchmark]: RCFGBuilder took 172.06 ms. Allocated memory is still 406.3 MB. Free memory was 351.3 MB in the beginning and 330.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:48,925 INFO L168 Benchmark]: TraceAbstraction took 18921.00 ms. Allocated memory was 406.3 MB in the beginning and 842.5 MB in the end (delta: 436.2 MB). Free memory was 330.5 MB in the beginning and 713.7 MB in the end (delta: -383.2 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. [2018-02-03 22:51:48,926 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.15 ms. Allocated memory is still 406.3 MB. Free memory is still 369.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.53 ms. Allocated memory is still 406.3 MB. Free memory was 363.2 MB in the beginning and 352.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.16 ms. Allocated memory is still 406.3 MB. Free memory was 352.6 MB in the beginning and 351.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.06 ms. Allocated memory is still 406.3 MB. Free memory was 351.3 MB in the beginning and 330.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18921.00 ms. Allocated memory was 406.3 MB in the beginning and 842.5 MB in the end (delta: 436.2 MB). Free memory was 330.5 MB in the beginning and 713.7 MB in the end (delta: -383.2 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. SAFE Result, 18.8s OverallTime, 31 OverallIterations, 4 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1135 SDtfs, 2138 SDslu, 6507 SDs, 0 SdLazy, 6123 SolverSat, 510 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 290 SyntacticMatches, 17 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=13, 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.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 268 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1132 ConstructedInterpolants, 79 QuantifiedInterpolants, 374337 SizeOfPredicates, 156 NumberOfNonLiveVariables, 1959 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 25/234 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-51-48-930.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-51-48-930.csv Received shutdown request...