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_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:06:01,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:06:01,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:06:01,883 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:06:01,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:06:01,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:06:01,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:06:01,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:06:01,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:06:01,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:06:01,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:06:01,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:06:01,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:06:01,891 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:06:01,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:06:01,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:06:01,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:06:01,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:06:01,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:06:01,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:06:01,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:06:01,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:06:01,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:06:01,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:06:01,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:06:01,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:06:01,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:06:01,903 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:06:01,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:06:01,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:06:01,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:06:01,904 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-04 12:06:01,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:06:01,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:06:01,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:06:01,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:06:01,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:06:01,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:06:01,916 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:06:01,916 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:06:01,916 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:06:01,916 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:06:01,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:06:01,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:06:01,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:06:01,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:06:01,917 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:06:01,917 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:06:01,917 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:06:01,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:06:01,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:06:01,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:06:01,956 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:06:01,959 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:06:01,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:06:01,961 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:06:01,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:06:02,114 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:06:02,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:06:02,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:06:02,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:06:02,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:06:02,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a8f894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02, skipping insertion in model container [2018-02-04 12:06:02,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,139 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:06:02,168 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:06:02,274 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:06:02,290 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:06:02,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02 WrapperNode [2018-02-04 12:06:02,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:06:02,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:06:02,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:06:02,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:06:02,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... [2018-02-04 12:06:02,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:06:02,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:06:02,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:06:02,328 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:06:02,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:06:02,367 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:06:02,367 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:06:02,368 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpncpy [2018-02-04 12:06:02,368 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:06:02,368 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:06:02,368 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:06:02,368 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:06:02,368 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:06:02,368 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure cstpncpy [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:06:02,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:06:02,651 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:06:02,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:06:02 BoogieIcfgContainer [2018-02-04 12:06:02,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:06:02,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:06:02,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:06:02,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:06:02,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:06:02" (1/3) ... [2018-02-04 12:06:02,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cd353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:06:02, skipping insertion in model container [2018-02-04 12:06:02,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:02" (2/3) ... [2018-02-04 12:06:02,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cd353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:06:02, skipping insertion in model container [2018-02-04 12:06:02,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:06:02" (3/3) ... [2018-02-04 12:06:02,655 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:06:02,660 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:06:02,666 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 12:06:02,699 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:06:02,699 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:06:02,700 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:06:02,700 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:06:02,700 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:06:02,700 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:06:02,700 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:06:02,700 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:06:02,701 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:06:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-02-04 12:06:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:06:02,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:02,724 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:02,724 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:02,728 INFO L82 PathProgramCache]: Analyzing trace with hash 149116887, now seen corresponding path program 1 times [2018-02-04 12:06:02,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:02,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:02,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:02,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:02,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:02,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:02,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:02,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:06:02,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:06:02,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:06:02,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:06:02,923 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-02-04 12:06:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,092 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-04 12:06:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:06:03,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:06:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,099 INFO L225 Difference]: With dead ends: 70 [2018-02-04 12:06:03,099 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:06:03,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:06:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:06:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 12:06:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:06:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 12:06:03,122 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13 [2018-02-04 12:06:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,122 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 12:06:03,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:06:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 12:06:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:06:03,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:03,123 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 149116888, now seen corresponding path program 1 times [2018-02-04 12:06:03,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,124 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:03,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:03,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:06:03,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:06:03,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:06:03,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:06:03,189 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 5 states. [2018-02-04 12:06:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,216 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 12:06:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:06:03,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 12:06:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,218 INFO L225 Difference]: With dead ends: 66 [2018-02-04 12:06:03,218 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:06:03,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:06:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:06:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 12:06:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 12:06:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-02-04 12:06:03,224 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 13 [2018-02-04 12:06:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,224 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-02-04 12:06:03,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:06:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-02-04 12:06:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:06:03,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,225 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:03,225 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074556, now seen corresponding path program 1 times [2018-02-04 12:06:03,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:03,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:03,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:06:03,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:06:03,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:06:03,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:06:03,270 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2018-02-04 12:06:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,311 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-02-04 12:06:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:06:03,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 12:06:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,313 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:06:03,313 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 12:06:03,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:06:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 12:06:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 12:06:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:06:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-04 12:06:03,317 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2018-02-04 12:06:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,318 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-04 12:06:03,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:06:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-04 12:06:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:06:03,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,318 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:03,319 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1345074557, now seen corresponding path program 1 times [2018-02-04 12:06:03,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:03,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:03,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:06:03,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:06:03,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:06:03,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:06:03,366 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 3 states. [2018-02-04 12:06:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,392 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 12:06:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:06:03,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 12:06:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,393 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:06:03,393 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:06:03,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:06:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:06:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:06:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:06:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:06:03,397 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2018-02-04 12:06:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,397 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:06:03,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:06:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:06:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:06:03,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,398 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] [2018-02-04 12:06:03,398 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018923, now seen corresponding path program 1 times [2018-02-04 12:06:03,399 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:03,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:03,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:06:03,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:06:03,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:06:03,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:06:03,545 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2018-02-04 12:06:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,676 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-04 12:06:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:06:03,676 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 12:06:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,677 INFO L225 Difference]: With dead ends: 56 [2018-02-04 12:06:03,677 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 12:06:03,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:06:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 12:06:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-02-04 12:06:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:06:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 12:06:03,680 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2018-02-04 12:06:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,681 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 12:06:03,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:06:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 12:06:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:06:03,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,681 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] [2018-02-04 12:06:03,681 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1779018922, now seen corresponding path program 1 times [2018-02-04 12:06:03,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:03,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:03,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:06:03,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:06:03,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:06:03,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:06:03,809 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-02-04 12:06:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:03,970 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 12:06:03,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:06:03,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 12:06:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:03,971 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:06:03,971 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:06:03,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:06:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:06:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 12:06:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:06:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 12:06:03,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25 [2018-02-04 12:06:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:03,974 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 12:06:03,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:06:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 12:06:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:06:03,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:03,979 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-04 12:06:03,979 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 684988236, now seen corresponding path program 1 times [2018-02-04 12:06:03,980 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:03,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:03,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,981 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:03,981 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:03,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:04,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:04,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:06:04,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 12:06:04,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 12:06:04,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:06:04,147 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 14 states. [2018-02-04 12:06:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:04,385 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 12:06:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:06:04,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-02-04 12:06:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:04,386 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:06:04,386 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:06:04,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:06:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:06:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-02-04 12:06:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:06:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:06:04,389 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 26 [2018-02-04 12:06:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:04,389 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:06:04,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 12:06:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:06:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:06:04,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:04,390 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-04 12:06:04,391 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 684988237, now seen corresponding path program 1 times [2018-02-04 12:06:04,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:04,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:04,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:04,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:04,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:04,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:04,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:06:04,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:06:04,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:06:04,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:06:04,628 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 13 states. [2018-02-04 12:06:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:04,814 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 12:06:04,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:06:04,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-04 12:06:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:04,815 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:06:04,815 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:06:04,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:06:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:06:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 12:06:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:06:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 12:06:04,818 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2018-02-04 12:06:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:04,818 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 12:06:04,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:06:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 12:06:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:06:04,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:04,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:04,819 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1786557187, now seen corresponding path program 1 times [2018-02-04 12:06:04,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:04,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:04,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:04,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:04,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:04,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:04,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:06:04,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:06:04,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:06:04,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:06:04,859 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-02-04 12:06:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:04,877 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 12:06:04,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:06:04,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 12:06:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:04,880 INFO L225 Difference]: With dead ends: 79 [2018-02-04 12:06:04,880 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 12:06:04,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:06:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 12:06:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-02-04 12:06:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:06:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 12:06:04,888 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2018-02-04 12:06:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:04,888 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 12:06:04,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:06:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 12:06:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:06:04,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:04,889 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:04,889 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash -18881147, now seen corresponding path program 1 times [2018-02-04 12:06:04,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:04,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:04,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:04,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:04,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:04,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:04,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:06:04,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:06:04,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:06:04,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:06:04,935 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-02-04 12:06:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:04,964 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-04 12:06:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:06:04,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 12:06:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:04,965 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:06:04,965 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:06:04,965 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-04 12:06:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:06:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-02-04 12:06:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:06:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 12:06:04,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2018-02-04 12:06:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:04,968 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 12:06:04,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:06:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 12:06:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:06:04,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:04,969 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:04,969 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash -25567208, now seen corresponding path program 1 times [2018-02-04 12:06:04,970 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:04,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:04,970 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:04,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:04,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:05,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:05,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:06:05,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:06:05,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:06:05,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:06:05,039 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 12:06:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:05,079 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-02-04 12:06:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:06:05,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 12:06:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:05,080 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:06:05,080 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:06:05,080 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-04 12:06:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:06:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-02-04 12:06:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 12:06:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-02-04 12:06:05,083 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-02-04 12:06:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:05,083 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-02-04 12:06:05,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:06:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-02-04 12:06:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:06:05,084 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:05,084 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:05,084 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash -159580714, now seen corresponding path program 1 times [2018-02-04 12:06:05,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:05,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:05,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:05,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:05,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:05,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:05,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:05,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:06:05,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:06:05,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:06:05,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:06:05,213 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 13 states. [2018-02-04 12:06:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:05,383 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2018-02-04 12:06:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:06:05,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-02-04 12:06:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:05,384 INFO L225 Difference]: With dead ends: 160 [2018-02-04 12:06:05,384 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 12:06:05,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-04 12:06:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 12:06:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2018-02-04 12:06:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 12:06:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-02-04 12:06:05,387 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 31 [2018-02-04 12:06:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:05,387 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-02-04 12:06:05,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:06:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-02-04 12:06:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:06:05,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:05,388 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:05,388 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash -19032104, now seen corresponding path program 1 times [2018-02-04 12:06:05,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:05,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:05,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:05,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:05,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:05,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:05,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:05,655 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-04 12:06:05,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:05,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:05,751 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-04 12:06:05,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04 12:06:05,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,763 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-04 12:06:05,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 12:06:05,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:05,827 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 14 treesize of output 17 [2018-02-04 12:06:05,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:05,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:05,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:05,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:05,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2018-02-04 12:06:05,910 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 26 treesize of output 27 [2018-02-04 12:06:05,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-02-04 12:06:05,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:05,946 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-04 12:06:05,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:33 [2018-02-04 12:06:06,013 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 26 treesize of output 27 [2018-02-04 12:06:06,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-02-04 12:06:06,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:06,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:06,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:06,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-02-04 12:06:06,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:06:06,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:06,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:06,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:06,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:06:06,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-02-04 12:06:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:06,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:06,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-02-04 12:06:06,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 12:06:06,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 12:06:06,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:06:06,267 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 25 states. [2018-02-04 12:06:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:07,210 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-02-04 12:06:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:06:07,210 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-02-04 12:06:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:07,211 INFO L225 Difference]: With dead ends: 140 [2018-02-04 12:06:07,211 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 12:06:07,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:06:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 12:06:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-02-04 12:06:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 12:06:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2018-02-04 12:06:07,217 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 31 [2018-02-04 12:06:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:07,217 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2018-02-04 12:06:07,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 12:06:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2018-02-04 12:06:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:06:07,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:07,218 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, 1, 1] [2018-02-04 12:06:07,218 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885648, now seen corresponding path program 1 times [2018-02-04 12:06:07,219 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:07,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:07,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:07,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:07,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:07,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:07,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:06:07,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:06:07,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:06:07,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:06:07,254 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 5 states. [2018-02-04 12:06:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:07,375 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-02-04 12:06:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:06:07,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 12:06:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:07,376 INFO L225 Difference]: With dead ends: 124 [2018-02-04 12:06:07,376 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 12:06:07,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:06:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 12:06:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 12:06:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 12:06:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-04 12:06:07,380 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 32 [2018-02-04 12:06:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:07,380 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-04 12:06:07,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:06:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-04 12:06:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:06:07,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:07,381 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, 1, 1] [2018-02-04 12:06:07,382 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1473885647, now seen corresponding path program 1 times [2018-02-04 12:06:07,382 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:07,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:07,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:07,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:07,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:07,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:07,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:06:07,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:06:07,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:06:07,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:06:07,446 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 6 states. [2018-02-04 12:06:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:07,491 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2018-02-04 12:06:07,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:06:07,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 12:06:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:07,492 INFO L225 Difference]: With dead ends: 158 [2018-02-04 12:06:07,492 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 12:06:07,493 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-04 12:06:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 12:06:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2018-02-04 12:06:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 12:06:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-02-04 12:06:07,496 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 32 [2018-02-04 12:06:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:07,497 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-02-04 12:06:07,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:06:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-02-04 12:06:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:06:07,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:07,498 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, 1, 1] [2018-02-04 12:06:07,498 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1333337037, now seen corresponding path program 1 times [2018-02-04 12:06:07,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:07,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:07,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:07,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:07,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:08,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:08,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 12:06:08,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:06:08,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:06:08,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:06:08,023 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 19 states. [2018-02-04 12:06:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:08,570 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-02-04 12:06:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:06:08,570 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-02-04 12:06:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:08,571 INFO L225 Difference]: With dead ends: 164 [2018-02-04 12:06:08,571 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 12:06:08,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:06:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 12:06:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2018-02-04 12:06:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 12:06:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-02-04 12:06:08,576 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 32 [2018-02-04 12:06:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:08,576 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-02-04 12:06:08,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:06:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-02-04 12:06:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:06:08,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:08,577 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, 1, 1] [2018-02-04 12:06:08,577 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1271297423, now seen corresponding path program 1 times [2018-02-04 12:06:08,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:08,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:08,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:08,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:08,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:08,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:08,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:08,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 12:06:08,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:06:08,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:06:08,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:06:08,922 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 18 states. [2018-02-04 12:06:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:09,525 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-02-04 12:06:09,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:06:09,525 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-02-04 12:06:09,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:09,527 INFO L225 Difference]: With dead ends: 162 [2018-02-04 12:06:09,528 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 12:06:09,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:06:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 12:06:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-02-04 12:06:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 12:06:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-02-04 12:06:09,533 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 32 [2018-02-04 12:06:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:09,533 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-02-04 12:06:09,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:06:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2018-02-04 12:06:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:06:09,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:09,534 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-04 12:06:09,534 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -589995253, now seen corresponding path program 1 times [2018-02-04 12:06:09,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:09,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:09,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:09,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:09,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:09,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:09,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:09,870 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-04 12:06:09,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:09,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:09,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:09,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:09,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:09,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:09,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:09,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:09,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:09,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:09,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:09,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 12:06:10,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:10,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:10,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:10,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:10,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:10,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-02-04 12:06:10,089 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 11 treesize of output 8 [2018-02-04 12:06:10,090 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 8 treesize of output 7 [2018-02-04 12:06:10,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,097 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 11 treesize of output 8 [2018-02-04 12:06:10,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:10,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-02-04 12:06:10,146 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 25 treesize of output 19 [2018-02-04 12:06:10,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:06:10,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:06:10,158 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 11 treesize of output 3 [2018-02-04 12:06:10,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:10,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:10,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-02-04 12:06:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:10,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:10,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 12:06:10,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 12:06:10,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 12:06:10,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:06:10,459 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 35 states. [2018-02-04 12:06:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:11,534 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2018-02-04 12:06:11,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:06:11,535 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2018-02-04 12:06:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:11,535 INFO L225 Difference]: With dead ends: 162 [2018-02-04 12:06:11,535 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 12:06:11,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:06:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 12:06:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-02-04 12:06:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 12:06:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2018-02-04 12:06:11,540 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32 [2018-02-04 12:06:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:11,540 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2018-02-04 12:06:11,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 12:06:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2018-02-04 12:06:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:06:11,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:11,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:11,540 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:11,540 INFO L82 PathProgramCache]: Analyzing trace with hash 449987274, now seen corresponding path program 1 times [2018-02-04 12:06:11,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:11,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:11,541 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:11,541 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:11,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:11,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:11,991 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-04 12:06:11,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:12,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:12,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:12,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:12,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:12,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:12,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:12,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:12,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:12,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 12:06:12,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:12,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:12,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:12,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:12,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:12,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 12:06:12,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:06:12,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:12,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 12:06:12,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:12,209 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-02-04 12:06:12,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-02-04 12:06:12,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-02-04 12:06:12,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:06:12,282 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 11 treesize of output 3 [2018-02-04 12:06:12,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:12,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:12,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-02-04 12:06:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:12,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:12,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-02-04 12:06:12,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 12:06:12,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 12:06:12,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 12:06:12,552 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 35 states. [2018-02-04 12:06:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:14,357 INFO L93 Difference]: Finished difference Result 218 states and 236 transitions. [2018-02-04 12:06:14,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:06:14,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2018-02-04 12:06:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:14,358 INFO L225 Difference]: With dead ends: 218 [2018-02-04 12:06:14,359 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 12:06:14,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=493, Invalid=4337, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 12:06:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 12:06:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-02-04 12:06:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 12:06:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-02-04 12:06:14,362 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 37 [2018-02-04 12:06:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:14,362 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-02-04 12:06:14,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 12:06:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-02-04 12:06:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:06:14,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:14,363 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-02-04 12:06:14,363 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash -490194150, now seen corresponding path program 2 times [2018-02-04 12:06:14,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:14,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:14,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:14,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:14,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:14,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:14,759 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-04 12:06:14,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:14,759 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-04 12:06:14,764 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:06:14,786 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:06:14,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:14,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:14,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:14,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:06:14,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:14,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:14,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:14,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:06:14,891 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-04 12:06:14,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:06:14,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:14,920 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-04 12:06:14,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 12:06:14,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:14,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 12:06:14,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:15,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:15,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:15,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:15,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:37 [2018-02-04 12:06:15,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-02-04 12:06:15,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 12:06:15,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,062 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 11 treesize of output 8 [2018-02-04 12:06:15,063 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 8 treesize of output 7 [2018-02-04 12:06:15,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:15,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:41 [2018-02-04 12:06:15,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 12:06:15,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 12:06:15,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,147 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-04 12:06:15,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-02-04 12:06:15,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-02-04 12:06:15,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-02-04 12:06:15,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:15,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:37 [2018-02-04 12:06:15,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:06:15,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:15,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:15,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:58 [2018-02-04 12:06:15,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 12:06:15,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:15,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-02-04 12:06:15,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:15,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-02-04 12:06:15,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-02-04 12:06:15,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:15,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:15,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:06:15,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:74, output treesize:61 [2018-02-04 12:06:15,774 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-04 12:06:15,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:15,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2018-02-04 12:06:15,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 12:06:15,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 12:06:15,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1624, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:06:15,792 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 42 states. [2018-02-04 12:06:16,667 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 106 DAG size of output 90 [2018-02-04 12:06:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:18,525 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2018-02-04 12:06:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:06:18,526 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 37 [2018-02-04 12:06:18,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:18,526 INFO L225 Difference]: With dead ends: 200 [2018-02-04 12:06:18,526 INFO L226 Difference]: Without dead ends: 200 [2018-02-04 12:06:18,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=286, Invalid=3373, Unknown=1, NotChecked=0, Total=3660 [2018-02-04 12:06:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-04 12:06:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 173. [2018-02-04 12:06:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 12:06:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2018-02-04 12:06:18,531 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 37 [2018-02-04 12:06:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:18,531 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2018-02-04 12:06:18,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 12:06:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2018-02-04 12:06:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:06:18,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:18,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:18,532 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1302548335, now seen corresponding path program 1 times [2018-02-04 12:06:18,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:18,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:18,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:18,533 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:18,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:18,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:18,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:18,906 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-04 12:06:18,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:18,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:18,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:18,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:18,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:18,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:18,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:18,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:18,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:18,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:18,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:18,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:06:18,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:18,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:19,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:19,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2018-02-04 12:06:19,026 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 28 treesize of output 25 [2018-02-04 12:06:19,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 8 treesize of output 7 [2018-02-04 12:06:19,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,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 24 treesize of output 21 [2018-02-04 12:06:19,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:19,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,059 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-02-04 12:06:19,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:19,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,092 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 34 treesize of output 31 [2018-02-04 12:06:19,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:19,093 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:19,107 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2018-02-04 12:06:19,174 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 45 treesize of output 39 [2018-02-04 12:06:19,176 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 20 treesize of output 11 [2018-02-04 12:06:19,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,193 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 30 treesize of output 26 [2018-02-04 12:06:19,194 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 11 treesize of output 3 [2018-02-04 12:06:19,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,206 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 34 treesize of output 30 [2018-02-04 12:06:19,208 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 11 treesize of output 3 [2018-02-04 12:06:19,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,220 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 23 treesize of output 19 [2018-02-04 12:06:19,221 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 11 treesize of output 3 [2018-02-04 12:06:19,221 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:06:19,230 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2018-02-04 12:06:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:19,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:19,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 32 [2018-02-04 12:06:19,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:06:19,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:06:19,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:06:19,654 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand 33 states. [2018-02-04 12:06:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:21,168 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2018-02-04 12:06:21,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:06:21,168 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 38 [2018-02-04 12:06:21,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:21,169 INFO L225 Difference]: With dead ends: 191 [2018-02-04 12:06:21,169 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 12:06:21,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 12:06:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 12:06:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2018-02-04 12:06:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 12:06:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-02-04 12:06:21,172 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 38 [2018-02-04 12:06:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:21,172 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-02-04 12:06:21,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:06:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-02-04 12:06:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:06:21,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:21,173 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-04 12:06:21,173 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1983850505, now seen corresponding path program 2 times [2018-02-04 12:06:21,173 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:21,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:21,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:21,173 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:21,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:21,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:21,712 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-04 12:06:21,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:21,712 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-04 12:06:21,717 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:06:21,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:06:21,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:21,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:21,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:21,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:21,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:21,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:21,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:21,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 12:06:21,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:21,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:21,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:21,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-02-04 12:06:21,960 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 11 treesize of output 8 [2018-02-04 12:06:21,961 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 8 treesize of output 7 [2018-02-04 12:06:21,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,967 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 11 treesize of output 8 [2018-02-04 12:06:21,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:21,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:21,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-02-04 12:06:22,028 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 25 treesize of output 19 [2018-02-04 12:06:22,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:06:22,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:22,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:22,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:06:22,039 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 11 treesize of output 3 [2018-02-04 12:06:22,039 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:22,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:22,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:22,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-02-04 12:06:22,438 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-04 12:06:22,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:22,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-02-04 12:06:22,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 12:06:22,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 12:06:22,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 12:06:22,471 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 38 states. [2018-02-04 12:06:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:24,203 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2018-02-04 12:06:24,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:06:24,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-02-04 12:06:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:24,205 INFO L225 Difference]: With dead ends: 229 [2018-02-04 12:06:24,205 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 12:06:24,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=512, Invalid=4600, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 12:06:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 12:06:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 172. [2018-02-04 12:06:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 12:06:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-02-04 12:06:24,210 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 38 [2018-02-04 12:06:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:24,211 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-02-04 12:06:24,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 12:06:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-02-04 12:06:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:06:24,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:24,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:24,212 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash -503906977, now seen corresponding path program 1 times [2018-02-04 12:06:24,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:24,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:24,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:24,213 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:24,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:24,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:24,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:06:24,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 12:06:24,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:06:24,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:06:24,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:06:24,535 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 18 states. [2018-02-04 12:06:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:24,755 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2018-02-04 12:06:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:06:24,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-02-04 12:06:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:24,756 INFO L225 Difference]: With dead ends: 196 [2018-02-04 12:06:24,756 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 12:06:24,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:06:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 12:06:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-04 12:06:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 12:06:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 12:06:24,757 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 41 [2018-02-04 12:06:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:24,757 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 12:06:24,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:06:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 12:06:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:06:24,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:24,758 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:24,758 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash -364387108, now seen corresponding path program 3 times [2018-02-04 12:06:24,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:24,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:24,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:24,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:24,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:24,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:06:25,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:25,173 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-04 12:06:25,183 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:06:25,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 12:06:25,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:25,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:25,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:25,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:06:25,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:25,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:25,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:25,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,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, 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-04 12:06:25,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:06:25,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 12:06:25,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 12:06:25,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 12:06:25,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:25,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:25,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:25,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-02-04 12:06:25,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-02-04 12:06:25,375 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 11 treesize of output 8 [2018-02-04 12:06:25,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 12:06:25,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-02-04 12:06:25,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2018-02-04 12:06:25,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-02-04 12:06:25,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 12:06:25,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-02-04 12:06:25,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-04 12:06:25,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-02-04 12:06:25,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:25,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-02-04 12:06:25,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 12:06:25,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:25,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:25,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:25 [2018-02-04 12:06:25,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-04 12:06:25,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:25,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:25,584 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-04 12:06:25,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-02-04 12:06:25,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 12:06:25,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 12:06:25,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:25,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:25,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:06:25,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:50 [2018-02-04 12:06:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:06:25,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:25,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 36 [2018-02-04 12:06:25,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 12:06:25,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 12:06:25,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:06:25,769 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 37 states. [2018-02-04 12:06:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:26,543 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 12:06:26,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:06:26,544 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2018-02-04 12:06:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:26,544 INFO L225 Difference]: With dead ends: 65 [2018-02-04 12:06:26,544 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 12:06:26,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=330, Invalid=2532, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:06:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 12:06:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-02-04 12:06:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:06:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 12:06:26,546 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 43 [2018-02-04 12:06:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:26,546 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 12:06:26,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 12:06:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 12:06:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 12:06:26,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:26,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:26,547 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash 907599341, now seen corresponding path program 2 times [2018-02-04 12:06:26,548 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:26,548 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:26,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:26,548 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:26,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:26,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:27,160 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-04 12:06:27,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:27,160 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-04 12:06:27,168 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:06:27,251 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:06:27,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:27,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:27,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:27,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:27,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:27,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:27,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:27,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 12:06:27,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:27,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:27,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:27,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-02-04 12:06:27,492 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 11 treesize of output 8 [2018-02-04 12:06:27,494 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 8 treesize of output 7 [2018-02-04 12:06:27,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,506 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 11 treesize of output 8 [2018-02-04 12:06:27,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:27,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-02-04 12:06:27,568 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 25 treesize of output 19 [2018-02-04 12:06:27,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:06:27,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:06:27,576 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 11 treesize of output 3 [2018-02-04 12:06:27,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:27,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:27,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-02-04 12:06:27,857 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-04 12:06:27,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:27,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-02-04 12:06:27,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:06:27,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:06:27,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:06:27,877 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 40 states. [2018-02-04 12:06:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:30,062 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-04 12:06:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 12:06:30,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2018-02-04 12:06:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:30,063 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:06:30,063 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:06:30,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=746, Invalid=6226, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 12:06:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:06:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-02-04 12:06:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:06:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-02-04 12:06:30,067 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-02-04 12:06:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:30,067 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-02-04 12:06:30,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:06:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-02-04 12:06:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 12:06:30,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:30,068 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1] [2018-02-04 12:06:30,068 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 650253902, now seen corresponding path program 1 times [2018-02-04 12:06:30,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:30,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:30,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:30,069 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:30,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:30,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:30,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:30,965 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-04 12:06:30,970 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:31,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:31,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:31,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:31,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:31,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:31,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:31,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:31,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:31,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:31,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:06:31,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:31,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:31,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:31,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:32 [2018-02-04 12:06:31,134 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 28 treesize of output 25 [2018-02-04 12:06:31,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:31,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-02-04 12:06:31,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:31,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,177 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 34 treesize of output 31 [2018-02-04 12:06:31,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:31,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,196 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 24 treesize of output 21 [2018-02-04 12:06:31,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:31,198 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:31,212 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:67, output treesize:52 [2018-02-04 12:06:31,277 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 45 treesize of output 39 [2018-02-04 12:06:31,278 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 20 treesize of output 11 [2018-02-04 12:06:31,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,292 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 30 treesize of output 26 [2018-02-04 12:06:31,293 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 11 treesize of output 3 [2018-02-04 12:06:31,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,304 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 34 treesize of output 30 [2018-02-04 12:06:31,305 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 11 treesize of output 3 [2018-02-04 12:06:31,305 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,316 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 23 treesize of output 19 [2018-02-04 12:06:31,317 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 11 treesize of output 3 [2018-02-04 12:06:31,317 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:31,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 12:06:31,325 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:80, output treesize:29 [2018-02-04 12:06:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:32,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:32,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 53 [2018-02-04 12:06:32,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 12:06:32,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 12:06:32,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2653, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:06:32,118 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 54 states. [2018-02-04 12:06:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:35,420 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-04 12:06:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 12:06:35,421 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 63 [2018-02-04 12:06:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:35,421 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:06:35,421 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:06:35,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=652, Invalid=7904, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 12:06:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:06:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-02-04 12:06:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:06:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-04 12:06:35,424 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 63 [2018-02-04 12:06:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:35,425 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-04 12:06:35,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 12:06:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-04 12:06:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 12:06:35,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:35,425 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:35,425 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstpncpyErr3RequiresViolation, cstpncpyErr10RequiresViolation, cstpncpyErr11RequiresViolation, cstpncpyErr7RequiresViolation, cstpncpyErr6RequiresViolation, cstpncpyErr2RequiresViolation, cstpncpyErr13RequiresViolation, cstpncpyErr15RequiresViolation, cstpncpyErr4RequiresViolation, cstpncpyErr5RequiresViolation, cstpncpyErr9RequiresViolation, cstpncpyErr0RequiresViolation, cstpncpyErr12RequiresViolation, cstpncpyErr17RequiresViolation, cstpncpyErr1RequiresViolation, cstpncpyErr8RequiresViolation, cstpncpyErr16RequiresViolation, cstpncpyErr14RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:06:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 692483813, now seen corresponding path program 3 times [2018-02-04 12:06:35,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:35,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:35,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:35,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:06:35,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:35,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 58 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:36,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:36,199 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-04 12:06:36,204 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:06:36,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 12:06:36,631 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:36,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:36,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:36,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:36,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:06:36,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:36,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 12:06:36,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-02-04 12:06:36,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:06:36,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:36,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:06:36,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-02-04 12:06:36,822 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 11 treesize of output 8 [2018-02-04 12:06:36,823 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 8 treesize of output 7 [2018-02-04 12:06:36,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,829 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 11 treesize of output 8 [2018-02-04 12:06:36,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:06:36,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-02-04 12:06:36,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 25 treesize of output 19 [2018-02-04 12:06:36,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 12:06:36,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 12:06:36,888 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 11 treesize of output 3 [2018-02-04 12:06:36,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:36,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:36,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-02-04 12:06:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:37,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:37,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-02-04 12:06:37,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:06:37,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:06:37,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2808, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:06:37,529 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 56 states. [2018-02-04 12:06:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:40,160 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-02-04 12:06:40,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 12:06:40,160 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 68 [2018-02-04 12:06:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:40,161 INFO L225 Difference]: With dead ends: 80 [2018-02-04 12:06:40,161 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:06:40,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2796 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1059, Invalid=9243, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 12:06:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:06:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:06:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:06:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:06:40,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-02-04 12:06:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:40,162 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:06:40,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:06:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:06:40,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:06:40,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:06:40 BoogieIcfgContainer [2018-02-04 12:06:40,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:06:40,166 INFO L168 Benchmark]: Toolchain (without parser) took 38052.03 ms. Allocated memory was 402.1 MB in the beginning and 1.0 GB in the end (delta: 600.3 MB). Free memory was 356.0 MB in the beginning and 713.7 MB in the end (delta: -357.8 MB). Peak memory consumption was 242.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:40,167 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:06:40,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.73 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:40,168 INFO L168 Benchmark]: Boogie Preprocessor took 29.70 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:40,168 INFO L168 Benchmark]: RCFGBuilder took 323.26 ms. Allocated memory is still 402.1 MB. Free memory was 342.7 MB in the beginning and 317.6 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:40,168 INFO L168 Benchmark]: TraceAbstraction took 37514.26 ms. Allocated memory was 402.1 MB in the beginning and 1.0 GB in the end (delta: 600.3 MB). Free memory was 317.6 MB in the beginning and 713.7 MB in the end (delta: -396.1 MB). Peak memory consumption was 204.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:40,170 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 181.73 ms. Allocated memory is still 402.1 MB. Free memory was 356.0 MB in the beginning and 345.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.70 ms. Allocated memory is still 402.1 MB. Free memory was 345.4 MB in the beginning and 342.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 323.26 ms. Allocated memory is still 402.1 MB. Free memory was 342.7 MB in the beginning and 317.6 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37514.26 ms. Allocated memory was 402.1 MB in the beginning and 1.0 GB in the end (delta: 600.3 MB). Free memory was 317.6 MB in the beginning and 713.7 MB in the end (delta: -396.1 MB). Peak memory consumption was 204.2 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 71 locations, 21 error locations. SAFE Result, 37.4s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 21.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1100 SDtfs, 2350 SDslu, 10632 SDs, 0 SdLazy, 12901 SolverSat, 834 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1151 GetRequests, 276 SyntacticMatches, 21 SemanticMatches, 854 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11958 ImplicationChecksByTransitivity, 24.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=20, 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, 27 MinimizatonAttempts, 296 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 1313 NumberOfCodeBlocks, 1313 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1276 ConstructedInterpolants, 258 QuantifiedInterpolants, 948966 SizeOfPredicates, 205 NumberOfNonLiveVariables, 2591 ConjunctsInSsa, 758 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 121/526 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_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-06-40-176.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-06-40-176.csv Received shutdown request...