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/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:06:11,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:06:11,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:06:11,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:06:11,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:06:11,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:06:11,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:06:11,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:06:11,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:06:11,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:06:11,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:06:11,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:06:11,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:06:11,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:06:11,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:06:11,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:06:11,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:06:11,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:06:11,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:06:11,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:06:11,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:06:11,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:06:11,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:06:11,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:06:11,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:06:11,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:06:11,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:06:11,195 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:06:11,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:06:11,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:06:11,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:06:11,195 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 00:06:11,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:06:11,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:06:11,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:06:11,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:06:11,205 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:06:11,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:06:11,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:06:11,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:06:11,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:06:11,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:06:11,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:06:11,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:06:11,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:06:11,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:06:11,207 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:06:11,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:06:11,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:06:11,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:06:11,246 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:06:11,248 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:06:11,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:06:11,250 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:06:11,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 00:06:11,378 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:06:11,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:06:11,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:06:11,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:06:11,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:06:11,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:06:11" (1/1) ... [2018-02-04 00:06:11,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:11, skipping insertion in model container [2018-02-04 00:06:11,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:06:11" (1/1) ... [2018-02-04 00:06:11,397 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:06:11,424 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:06:11,514 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:06:11,529 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:06:11,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:11 WrapperNode [2018-02-04 00:06:11,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:06:11,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:06:11,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:06:11,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:06:11,549 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:11" (1/1) ... [2018-02-04 00:06:11,549 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:11" (1/1) ... [2018-02-04 00:06:11,556 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:11" (1/1) ... [2018-02-04 00:06:11,557 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:11" (1/1) ... [2018-02-04 00:06:11,561 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:11" (1/1) ... [2018-02-04 00:06:11,564 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:11" (1/1) ... [2018-02-04 00:06:11,565 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:11" (1/1) ... [2018-02-04 00:06:11,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:06:11,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:06:11,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:06:11,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:06:11,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:11" (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 00:06:11,608 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:06:11,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:06:11,609 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 00:06:11,609 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:06:11,609 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:06:11,610 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:06:11,855 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:06:11,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:06:11 BoogieIcfgContainer [2018-02-04 00:06:11,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:06:11,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:06:11,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:06:11,859 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:06:11,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:06:11" (1/3) ... [2018-02-04 00:06:11,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:06:11, skipping insertion in model container [2018-02-04 00:06:11,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:06:11" (2/3) ... [2018-02-04 00:06:11,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bd9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:06:11, skipping insertion in model container [2018-02-04 00:06:11,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:06:11" (3/3) ... [2018-02-04 00:06:11,862 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-02-04 00:06:11,867 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:06:11,873 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 00:06:11,896 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:06:11,897 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:06:11,897 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:06:11,897 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:06:11,897 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:06:11,897 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:06:11,897 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:06:11,897 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:06:11,898 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:06:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-02-04 00:06:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 00:06:11,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:11,919 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:11,919 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-02-04 00:06:11,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:11,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:11,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:11,955 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:11,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:11,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:12,030 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 00:06:12,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:12,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:06:12,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:06:12,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:06:12,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:06:12,043 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-02-04 00:06:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:12,232 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-04 00:06:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:06:12,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 00:06:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:12,240 INFO L225 Difference]: With dead ends: 110 [2018-02-04 00:06:12,240 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 00:06:12,242 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 00:06:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 00:06:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-02-04 00:06:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 00:06:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-04 00:06:12,272 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-02-04 00:06:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:12,273 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-04 00:06:12,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:06:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-04 00:06:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 00:06:12,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:12,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:12,274 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-02-04 00:06:12,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:12,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:12,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:12,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:12,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:12,329 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 00:06:12,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:12,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:06:12,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:06:12,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:06:12,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:06:12,331 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-02-04 00:06:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:12,400 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-02-04 00:06:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:06:12,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 00:06:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:12,401 INFO L225 Difference]: With dead ends: 103 [2018-02-04 00:06:12,401 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 00:06:12,402 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 00:06:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 00:06:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-04 00:06:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 00:06:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 00:06:12,409 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-02-04 00:06:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:12,409 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 00:06:12,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:06:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 00:06:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:06:12,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:12,410 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:12,410 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-02-04 00:06:12,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:12,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:12,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:12,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:12,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:12,478 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 00:06:12,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:12,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:06:12,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:06:12,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:06:12,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:06:12,479 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-02-04 00:06:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:12,595 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-04 00:06:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:06:12,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 00:06:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:12,598 INFO L225 Difference]: With dead ends: 99 [2018-02-04 00:06:12,598 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 00:06:12,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 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 00:06:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 00:06:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 00:06:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 00:06:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-04 00:06:12,603 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-02-04 00:06:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:12,603 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-04 00:06:12,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:06:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-04 00:06:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:06:12,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:12,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:12,604 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-02-04 00:06:12,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:12,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:12,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:12,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:12,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:12,713 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 00:06:12,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:12,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:06:12,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:06:12,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:06:12,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:06:12,714 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-02-04 00:06:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:12,906 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 00:06:12,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:06:12,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 00:06:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:12,907 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:06:12,907 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:06:12,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:06:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:06:12,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-04 00:06:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 00:06:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-02-04 00:06:12,913 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-02-04 00:06:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:12,914 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-02-04 00:06:12,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:06:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-02-04 00:06:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:06:12,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:12,914 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:12,914 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-02-04 00:06:12,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:12,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:12,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,916 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:12,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:12,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:12,947 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 00:06:12,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:12,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:06:12,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:06:12,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:06:12,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:06:12,948 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 4 states. [2018-02-04 00:06:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:13,019 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 00:06:13,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:06:13,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 00:06:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:13,020 INFO L225 Difference]: With dead ends: 111 [2018-02-04 00:06:13,020 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 00:06:13,020 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 00:06:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 00:06:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-04 00:06:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 00:06:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-02-04 00:06:13,025 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2018-02-04 00:06:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:13,026 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-02-04 00:06:13,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:06:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-02-04 00:06:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:06:13,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:13,026 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:13,027 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-02-04 00:06:13,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:13,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:13,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:13,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:13,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:13,065 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 00:06:13,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:13,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:06:13,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:06:13,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:06:13,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:06:13,066 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2018-02-04 00:06:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:13,112 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 00:06:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:06:13,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 00:06:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:13,113 INFO L225 Difference]: With dead ends: 107 [2018-02-04 00:06:13,113 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 00:06:13,113 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 00:06:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 00:06:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 00:06:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 00:06:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-02-04 00:06:13,117 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 15 [2018-02-04 00:06:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:13,117 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-02-04 00:06:13,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:06:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-02-04 00:06:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:06:13,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:13,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:13,119 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-02-04 00:06:13,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:13,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:13,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:13,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:13,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:13,197 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 00:06:13,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:13,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:06:13,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:06:13,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:06:13,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:06:13,198 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 8 states. [2018-02-04 00:06:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:13,364 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-04 00:06:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:06:13,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 00:06:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:13,365 INFO L225 Difference]: With dead ends: 104 [2018-02-04 00:06:13,365 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 00:06:13,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:06:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 00:06:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-02-04 00:06:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 00:06:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-02-04 00:06:13,370 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2018-02-04 00:06:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:13,370 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-02-04 00:06:13,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:06:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-02-04 00:06:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:06:13,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:13,371 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] [2018-02-04 00:06:13,371 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1229999684, now seen corresponding path program 1 times [2018-02-04 00:06:13,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:13,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:13,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:13,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:13,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:13,464 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 00:06:13,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:13,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:06:13,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:06:13,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:06:13,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:06:13,464 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 6 states. [2018-02-04 00:06:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:13,546 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 00:06:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:06:13,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 00:06:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:13,547 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:06:13,547 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:06:13,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:06:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:06:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2018-02-04 00:06:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 00:06:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 00:06:13,550 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 31 [2018-02-04 00:06:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:13,551 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 00:06:13,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:06:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 00:06:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:06:13,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:13,552 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 00:06:13,552 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-02-04 00:06:13,552 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:13,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:13,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:13,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:13,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:13,614 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 00:06:13,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:13,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:06:13,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:06:13,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:06:13,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:06:13,615 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 7 states. [2018-02-04 00:06:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:13,716 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 00:06:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:06:13,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 00:06:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:13,716 INFO L225 Difference]: With dead ends: 130 [2018-02-04 00:06:13,716 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 00:06:13,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:06:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 00:06:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2018-02-04 00:06:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 00:06:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-02-04 00:06:13,719 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 32 [2018-02-04 00:06:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:13,719 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-02-04 00:06:13,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:06:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-02-04 00:06:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:06:13,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:13,720 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 00:06:13,720 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-02-04 00:06:13,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:13,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:13,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:13,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:13,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:13,844 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 00:06:13,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:13,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:06:13,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:06:13,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:06:13,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:06:13,844 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 9 states. [2018-02-04 00:06:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,002 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 00:06:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:06:14,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 00:06:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,003 INFO L225 Difference]: With dead ends: 127 [2018-02-04 00:06:14,003 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 00:06:14,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:06:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 00:06:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 110. [2018-02-04 00:06:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 00:06:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-02-04 00:06:14,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 32 [2018-02-04 00:06:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,005 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-02-04 00:06:14,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:06:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-02-04 00:06:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:06:14,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,007 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 00:06:14,007 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-02-04 00:06:14,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,029 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 00:06:14,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:14,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:06:14,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:06:14,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:06:14,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:06:14,030 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 3 states. [2018-02-04 00:06:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,041 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-02-04 00:06:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:06:14,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-04 00:06:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,042 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:06:14,043 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:06:14,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 00:06:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:06:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 00:06:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:06:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-02-04 00:06:14,045 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 32 [2018-02-04 00:06:14,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,046 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-02-04 00:06:14,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:06:14,046 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-02-04 00:06:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:06:14,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,047 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] [2018-02-04 00:06:14,047 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,047 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-02-04 00:06:14,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,070 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 00:06:14,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:14,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:06:14,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:06:14,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:06:14,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:06:14,071 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 3 states. [2018-02-04 00:06:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,077 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-04 00:06:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:06:14,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-04 00:06:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,078 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:06:14,078 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:06:14,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 00:06:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:06:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-02-04 00:06:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 00:06:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-02-04 00:06:14,079 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-02-04 00:06:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,080 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-02-04 00:06:14,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:06:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-02-04 00:06:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:06:14,080 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,080 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:14,080 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash -302598238, now seen corresponding path program 1 times [2018-02-04 00:06:14,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:14,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:06:14,203 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 00:06:14,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:06:14,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:06:14,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:06:14,358 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 00:06:14,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:14,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 00:06:14,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:14,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:06:14,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 00:06:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:14,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:06:14,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-02-04 00:06:14,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:06:14,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:06:14,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:06:14,441 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 14 states. [2018-02-04 00:06:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,607 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 00:06:14,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:06:14,608 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 00:06:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,609 INFO L225 Difference]: With dead ends: 91 [2018-02-04 00:06:14,609 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 00:06:14,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:06:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 00:06:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-02-04 00:06:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 00:06:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-02-04 00:06:14,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 34 [2018-02-04 00:06:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,612 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-02-04 00:06:14,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:06:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-02-04 00:06:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:06:14,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,615 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] [2018-02-04 00:06:14,615 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-02-04 00:06:14,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,644 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 00:06:14,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:14,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:06:14,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:06:14,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:06:14,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:06:14,645 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 4 states. [2018-02-04 00:06:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,661 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-02-04 00:06:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:06:14,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 00:06:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,662 INFO L225 Difference]: With dead ends: 84 [2018-02-04 00:06:14,662 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:06:14,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:06:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:06:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 00:06:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:06:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-02-04 00:06:14,665 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 35 [2018-02-04 00:06:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,665 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-02-04 00:06:14,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:06:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-02-04 00:06:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:06:14,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,666 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] [2018-02-04 00:06:14,666 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-02-04 00:06:14,666 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,724 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 00:06:14,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:14,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:06:14,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:06:14,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:06:14,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:06:14,725 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 8 states. [2018-02-04 00:06:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,818 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-02-04 00:06:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:06:14,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 00:06:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,820 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:06:14,820 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 00:06:14,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:06:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 00:06:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 00:06:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:06:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-02-04 00:06:14,822 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 35 [2018-02-04 00:06:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,823 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-02-04 00:06:14,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:06:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-02-04 00:06:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:06:14,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,823 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] [2018-02-04 00:06:14,823 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-02-04 00:06:14,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,825 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:14,869 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 00:06:14,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:14,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:06:14,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:06:14,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:06:14,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:06:14,870 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 5 states. [2018-02-04 00:06:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:14,934 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 00:06:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:06:14,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 00:06:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:14,935 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:06:14,935 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:06:14,935 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 00:06:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:06:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 00:06:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:06:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-02-04 00:06:14,937 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 35 [2018-02-04 00:06:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:14,938 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-02-04 00:06:14,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:06:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-02-04 00:06:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:06:14,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:14,938 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] [2018-02-04 00:06:14,938 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-02-04 00:06:14,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:14,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:14,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,939 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:14,940 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:14,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:15,040 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 00:06:15,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:15,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:06:15,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:06:15,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:06:15,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:06:15,041 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 10 states. [2018-02-04 00:06:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:15,210 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 00:06:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:06:15,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-04 00:06:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:15,212 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:06:15,212 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:06:15,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:06:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:06:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 00:06:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 00:06:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-02-04 00:06:15,215 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 37 [2018-02-04 00:06:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:15,215 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-02-04 00:06:15,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:06:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-02-04 00:06:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:06:15,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:15,216 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:15,216 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-02-04 00:06:15,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:15,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:15,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:15,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:15,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:15,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:15,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:06:15,355 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 00:06:15,360 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:15,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:06:15,410 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 11 treesize of output 8 [2018-02-04 00:06:15,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:06:15,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 00:06:15,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 00:06:15,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-04 00:06:15,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-04 00:06:15,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:06:15,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,558 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 00:06:15,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-04 00:06:15,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-04 00:06:15,591 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 0 case distinctions, treesize of input 20 treesize of output 5 [2018-02-04 00:06:15,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:15,597 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 00:06:15,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-04 00:06:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:15,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:06:15,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-02-04 00:06:15,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:06:15,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:06:15,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:06:15,624 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 20 states. [2018-02-04 00:06:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:16,042 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-02-04 00:06:16,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:06:16,042 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-02-04 00:06:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:16,043 INFO L225 Difference]: With dead ends: 81 [2018-02-04 00:06:16,043 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 00:06:16,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-02-04 00:06:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 00:06:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 00:06:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 00:06:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-02-04 00:06:16,046 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 40 [2018-02-04 00:06:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:16,046 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-02-04 00:06:16,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:06:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-02-04 00:06:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:06:16,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:16,047 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:06:16,047 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324109, now seen corresponding path program 1 times [2018-02-04 00:06:16,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:16,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:16,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:16,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:16,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:16,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:16,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:06:16,258 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 00:06:16,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:16,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:06:16,308 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 11 treesize of output 8 [2018-02-04 00:06:16,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:06:16,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,318 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 11 treesize of output 8 [2018-02-04 00:06:16,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 00:06:16,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,326 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 00:06:16,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-04 00:06:16,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:06:16,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:06:16,391 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 15 treesize of output 8 [2018-02-04 00:06:16,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:06:16,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-04 00:06:16,469 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-04 00:06:16,473 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 34 treesize of output 33 [2018-02-04 00:06:16,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,505 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-04 00:06:16,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-04 00:06:16,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:06:16,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-04 00:06:16,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-04 00:06:16,566 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 30 treesize of output 23 [2018-02-04 00:06:16,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,577 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 23 treesize of output 14 [2018-02-04 00:06:16,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-04 00:06:16,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-04 00:06:16,610 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 22 treesize of output 15 [2018-02-04 00:06:16,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,618 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 15 treesize of output 8 [2018-02-04 00:06:16,619 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,626 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 0 case distinctions, treesize of input 18 treesize of output 3 [2018-02-04 00:06:16,627 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:06:16,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:06:16,634 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-04 00:06:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:06:16,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:06:16,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-04 00:06:16,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:06:16,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:06:16,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-02-04 00:06:16,678 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 22 states. [2018-02-04 00:06:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:17,254 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-02-04 00:06:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:06:17,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-02-04 00:06:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:17,255 INFO L225 Difference]: With dead ends: 80 [2018-02-04 00:06:17,255 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 00:06:17,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-02-04 00:06:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 00:06:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-04 00:06:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 00:06:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 00:06:17,257 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 40 [2018-02-04 00:06:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:17,257 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 00:06:17,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:06:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 00:06:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:06:17,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:17,258 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, 1] [2018-02-04 00:06:17,258 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1242227968, now seen corresponding path program 1 times [2018-02-04 00:06:17,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:17,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:17,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:17,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:17,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:06:17,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:06:17,282 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 00:06:17,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:06:17,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:06:17,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:06:17,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:06:17,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:06:17,283 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2018-02-04 00:06:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:06:17,297 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-02-04 00:06:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:06:17,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 00:06:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:06:17,298 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:06:17,298 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:06:17,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:06:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:06:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-04 00:06:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 00:06:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-04 00:06:17,300 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 42 [2018-02-04 00:06:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:06:17,300 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-04 00:06:17,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:06:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-04 00:06:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:06:17,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:06:17,300 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, 1, 1, 1] [2018-02-04 00:06:17,300 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:06:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash -221032996, now seen corresponding path program 1 times [2018-02-04 00:06:17,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:06:17,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:06:17,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:17,301 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:06:17,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:06:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:06:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:06:17,365 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 00:06:17,382 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 00:06:17,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:06:17 BoogieIcfgContainer [2018-02-04 00:06:17,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:06:17,400 INFO L168 Benchmark]: Toolchain (without parser) took 6021.65 ms. Allocated memory was 399.0 MB in the beginning and 712.5 MB in the end (delta: 313.5 MB). Free memory was 355.9 MB in the beginning and 485.6 MB in the end (delta: -129.8 MB). Peak memory consumption was 183.7 MB. Max. memory is 5.3 GB. [2018-02-04 00:06:17,401 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:06:17,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.49 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:06:17,402 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:06:17,402 INFO L168 Benchmark]: RCFGBuilder took 287.89 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 314.0 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:06:17,402 INFO L168 Benchmark]: TraceAbstraction took 5543.59 ms. Allocated memory was 399.0 MB in the beginning and 712.5 MB in the end (delta: 313.5 MB). Free memory was 314.0 MB in the beginning and 485.6 MB in the end (delta: -171.6 MB). Peak memory consumption was 141.9 MB. Max. memory is 5.3 GB. [2018-02-04 00:06:17,403 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.10 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.49 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.79 ms. Allocated memory is still 399.0 MB. Free memory was 345.3 MB in the beginning and 344.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 287.89 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 314.0 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5543.59 ms. Allocated memory was 399.0 MB in the beginning and 712.5 MB in the end (delta: 313.5 MB). Free memory was 314.0 MB in the beginning and 485.6 MB in the end (delta: -171.6 MB). Peak memory consumption was 141.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={14:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, \old(c)=0, c=1, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L633] RET, FCALL *plist = item VAL [\old(c)=0, c=1, item={14:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={9:0}, plist={9:0}] [L640] append(&list) VAL [\old(c)=0, c=1, length=0, list={9:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={9:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={9:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={9:0}] [L647] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}] [L647] EXPR, FCALL list->next VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR, FCALL \read(*list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L648] FCALL free(list) VAL [\old(c)=0, \read(*list)={14:0}, c=1, length=1, list={9:0}, next={0:0}] [L649] FCALL list = next VAL [\old(c)=0, c=1, length=1, list={9:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, \result=0, c=1, length=0, list={9:0}, next={0:0}] [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 43 error locations. UNSAFE Result, 5.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1310 SDtfs, 1068 SDslu, 3358 SDs, 0 SdLazy, 2840 SolverSat, 158 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, 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, 20 MinimizatonAttempts, 83 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 641 ConstructedInterpolants, 13 QuantifiedInterpolants, 156146 SizeOfPredicates, 42 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 16/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-06-17-410.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-06-17-410.csv Received shutdown request...