java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:28:48,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:28:48,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:28:48,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:28:48,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:28:48,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:28:48,269 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:28:48,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:28:48,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:28:48,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:28:48,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:28:48,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:28:48,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:28:48,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:28:48,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:28:48,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:28:48,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:28:48,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:28:48,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:28:48,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:28:48,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:28:48,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:28:48,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:28:48,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:28:48,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:28:48,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:28:48,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:28:48,287 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:28:48,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:28:48,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:28:48,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:28:48,288 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-02 18:28:48,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:28:48,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:28:48,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:28:48,299 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:28:48,299 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:28:48,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:28:48,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:28:48,300 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:28:48,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:28:48,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:28:48,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:28:48,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:28:48,302 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:28:48,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:28:48,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:28:48,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:28:48,339 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:28:48,341 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:28:48,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:28:48,342 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:28:48,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:28:48,452 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:28:48,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:28:48,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:28:48,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:28:48,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:28:48,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2a3f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48, skipping insertion in model container [2018-02-02 18:28:48,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,480 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:28:48,509 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:28:48,590 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:28:48,602 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:28:48,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48 WrapperNode [2018-02-02 18:28:48,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:28:48,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:28:48,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:28:48,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:28:48,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (1/1) ... [2018-02-02 18:28:48,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:28:48,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:28:48,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:28:48,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:28:48,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (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-02 18:28:48,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:28:48,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:28:48,668 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-02-02 18:28:48,668 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:28:48,668 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:28:48,668 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:28:48,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:28:48,668 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:28:48,668 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:28:48,669 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:28:48,669 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-02-02 18:28:48,669 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:28:48,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:28:48,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:28:48,814 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:28:48,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:28:48 BoogieIcfgContainer [2018-02-02 18:28:48,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:28:48,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:28:48,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:28:48,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:28:48,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:28:48" (1/3) ... [2018-02-02 18:28:48,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5d56df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:28:48, skipping insertion in model container [2018-02-02 18:28:48,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:28:48" (2/3) ... [2018-02-02 18:28:48,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5d56df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:28:48, skipping insertion in model container [2018-02-02 18:28:48,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:28:48" (3/3) ... [2018-02-02 18:28:48,818 INFO L107 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:28:48,823 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:28:48,828 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 18:28:48,857 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:28:48,858 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:28:48,858 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:28:48,858 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:28:48,858 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:28:48,858 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:28:48,858 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:28:48,858 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:28:48,859 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:28:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-02 18:28:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:28:48,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:48,879 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:48,880 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-02-02 18:28:48,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:48,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:48,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:48,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:48,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:48,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,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-02 18:28:49,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:28:49,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:28:49,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:28:49,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:28:49,087 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-02 18:28:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,240 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 18:28:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:28:49,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 18:28:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,250 INFO L225 Difference]: With dead ends: 54 [2018-02-02 18:28:49,250 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 18:28:49,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:28:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 18:28:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 18:28:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 18:28:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-02 18:28:49,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-02-02 18:28:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,276 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-02 18:28:49,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:28:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-02 18:28:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:28:49,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,277 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,277 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-02-02 18:28:49,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,278 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,368 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-02 18:28:49,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:28:49,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:28:49,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:28:49,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:28:49,370 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-02-02 18:28:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,427 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 18:28:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:28:49,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 18:28:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,428 INFO L225 Difference]: With dead ends: 50 [2018-02-02 18:28:49,429 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 18:28:49,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:28:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 18:28:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 18:28:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 18:28:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-02 18:28:49,434 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-02-02 18:28:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,434 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-02 18:28:49,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:28:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-02 18:28:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:28:49,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,435 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,435 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-02-02 18:28:49,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,435 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,436 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,468 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-02 18:28:49,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:28:49,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:28:49,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:28:49,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:28:49,469 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-02-02 18:28:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,524 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-02 18:28:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:28:49,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 18:28:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,526 INFO L225 Difference]: With dead ends: 49 [2018-02-02 18:28:49,526 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 18:28:49,527 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-02 18:28:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 18:28:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 18:28:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 18:28:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-02 18:28:49,531 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-02-02 18:28:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,531 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-02 18:28:49,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:28:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-02 18:28:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:28:49,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,532 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,532 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-02-02 18:28:49,532 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,533 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,534 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,594 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-02 18:28:49,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:28:49,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:28:49,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:28:49,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:28:49,595 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-02-02 18:28:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,648 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 18:28:49,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:28:49,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 18:28:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,649 INFO L225 Difference]: With dead ends: 48 [2018-02-02 18:28:49,649 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 18:28:49,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:28:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 18:28:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 18:28:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 18:28:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-02 18:28:49,653 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-02-02 18:28:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,653 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-02 18:28:49,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:28:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-02 18:28:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:28:49,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,654 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,654 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-02-02 18:28:49,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,655 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,693 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-02 18:28:49,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:28:49,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:28:49,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:28:49,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:28:49,695 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-02 18:28:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,734 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 18:28:49,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:28:49,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 18:28:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,735 INFO L225 Difference]: With dead ends: 46 [2018-02-02 18:28:49,735 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 18:28:49,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:28:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 18:28:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 18:28:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 18:28:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-02-02 18:28:49,739 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-02-02 18:28:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,739 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-02-02 18:28:49,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:28:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-02-02 18:28:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 18:28:49,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,740 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,740 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,740 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-02-02 18:28:49,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,814 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-02 18:28:49,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:28:49,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:28:49,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:28:49,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:28:49,815 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-02-02 18:28:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,909 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-02-02 18:28:49,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:28:49,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-02 18:28:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,912 INFO L225 Difference]: With dead ends: 67 [2018-02-02 18:28:49,912 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 18:28:49,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:28:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 18:28:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-02-02 18:28:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 18:28:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-02-02 18:28:49,917 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-02-02 18:28:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,917 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-02-02 18:28:49,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:28:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-02-02 18:28:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:28:49,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,918 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,918 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-02-02 18:28:49,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,919 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,919 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:49,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:49,953 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-02 18:28:49,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:49,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:28:49,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:28:49,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:28:49,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:28:49,954 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-02-02 18:28:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:49,989 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-02-02 18:28:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:28:49,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 18:28:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:49,990 INFO L225 Difference]: With dead ends: 54 [2018-02-02 18:28:49,990 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 18:28:49,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:28:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 18:28:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 18:28:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 18:28:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-02 18:28:49,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-02-02 18:28:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:49,993 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-02 18:28:49,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:28:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-02 18:28:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:28:49,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:49,993 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:49,993 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-02-02 18:28:49,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:49,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:49,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:49,994 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:49,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:50,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:50,061 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-02 18:28:50,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:50,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:28:50,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:28:50,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:28:50,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:28:50,062 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-02-02 18:28:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:50,150 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2018-02-02 18:28:50,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:28:50,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 18:28:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:50,151 INFO L225 Difference]: With dead ends: 70 [2018-02-02 18:28:50,151 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 18:28:50,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:28:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 18:28:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-02-02 18:28:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 18:28:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-02-02 18:28:50,153 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-02-02 18:28:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:50,153 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-02-02 18:28:50,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:28:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-02-02 18:28:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:28:50,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:50,154 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:50,154 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-02-02 18:28:50,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:50,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:50,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:50,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:50,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:50,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:50,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:28:50,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:28:50,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:28:50,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:28:50,182 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-02-02 18:28:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:50,185 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-02-02 18:28:50,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:28:50,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 18:28:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:50,186 INFO L225 Difference]: With dead ends: 67 [2018-02-02 18:28:50,187 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 18:28:50,187 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-02 18:28:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 18:28:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-02-02 18:28:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 18:28:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-02-02 18:28:50,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-02-02 18:28:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:50,191 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-02-02 18:28:50,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:28:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-02-02 18:28:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:28:50,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:50,192 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:50,192 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:50,192 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-02-02 18:28:50,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:50,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:50,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:50,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:50,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:50,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:50,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 18:28:50,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:28:50,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:28:50,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:28:50,434 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-02-02 18:28:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:50,743 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-02-02 18:28:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 18:28:50,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 18:28:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:50,744 INFO L225 Difference]: With dead ends: 112 [2018-02-02 18:28:50,744 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 18:28:50,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-02-02 18:28:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 18:28:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-02-02 18:28:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 18:28:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-02-02 18:28:50,749 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-02-02 18:28:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:50,749 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-02-02 18:28:50,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:28:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-02-02 18:28:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:28:50,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:50,749 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:50,749 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-02-02 18:28:50,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:50,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:50,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:50,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:50,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:51,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:28:51,044 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-02 18:28:51,053 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:51,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:28:51,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:28:51,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:28:51,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:28:51,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:28:51,181 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-02 18:28:51,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:28:51,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 18:28:51,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:28:51,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,239 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-02 18:28:51,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 18:28:51,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 18:28:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:28:51,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:51,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 18:28:51,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 18:28:52,107 WARN L143 SmtUtils]: Spent 541ms on a formula simplification that was a NOOP. DAG size: 43 [2018-02-02 18:28:52,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-02-02 18:28:52,219 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 41 treesize of output 33 [2018-02-02 18:28:52,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-02-02 18:28:52,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:28:52,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-02-02 18:28:52,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:28:52,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2018-02-02 18:28:52,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-02 18:28:52,426 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 27 treesize of output 19 [2018-02-02 18:28:52,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,428 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 31 treesize of output 23 [2018-02-02 18:28:52,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,517 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 31 treesize of output 23 [2018-02-02 18:28:52,517 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,518 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 35 treesize of output 27 [2018-02-02 18:28:52,519 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,560 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 27 treesize of output 20 [2018-02-02 18:28:52,560 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,561 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 16 [2018-02-02 18:28:52,562 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:52,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:28:52,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:28:52,647 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-02-02 18:28:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:52,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:28:52,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-02 18:28:52,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 18:28:52,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 18:28:52,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-02-02 18:28:52,714 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-02-02 18:28:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:55,549 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-02-02 18:28:55,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:28:55,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-02-02 18:28:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:55,550 INFO L225 Difference]: With dead ends: 109 [2018-02-02 18:28:55,550 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 18:28:55,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=330, Invalid=2220, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 18:28:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 18:28:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2018-02-02 18:28:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 18:28:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-02-02 18:28:55,556 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-02-02 18:28:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:55,556 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-02-02 18:28:55,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 18:28:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-02-02 18:28:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:28:55,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:55,557 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:55,558 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:55,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-02-02 18:28:55,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:55,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:55,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:55,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:55,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:55,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:55,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-02 18:28:55,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:55,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:28:55,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:28:55,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:28:55,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:28:55,645 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-02-02 18:28:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:55,736 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-02-02 18:28:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:28:55,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 18:28:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:55,737 INFO L225 Difference]: With dead ends: 88 [2018-02-02 18:28:55,737 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 18:28:55,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:28:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 18:28:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-02 18:28:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 18:28:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-02-02 18:28:55,739 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-02-02 18:28:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:55,739 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-02-02 18:28:55,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:28:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-02-02 18:28:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:28:55,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:55,740 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:55,740 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-02-02 18:28:55,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:55,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:55,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:55,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:55,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:55,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:28:55,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:28:55,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 18:28:55,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:28:55,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:28:55,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:28:55,876 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 12 states. [2018-02-02 18:28:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:56,029 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 18:28:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:28:56,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-02 18:28:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:56,030 INFO L225 Difference]: With dead ends: 54 [2018-02-02 18:28:56,030 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 18:28:56,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:28:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 18:28:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 18:28:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 18:28:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 18:28:56,032 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-02-02 18:28:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:56,033 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 18:28:56,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:28:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 18:28:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:28:56,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:56,034 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:56,034 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-02-02 18:28:56,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:56,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:56,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:56,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:56,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:56,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:56,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:28:56,205 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-02 18:28:56,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:56,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:28:56,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 18:28:56,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:28:56,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:56,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:56,251 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-02 18:28:56,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 18:28:56,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-02 18:28:56,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 18:28:56,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:28:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:28:56,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:28:56,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-02 18:28:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:56,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:28:56,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-02-02 18:28:56,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:28:56,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:28:56,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:28:56,440 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2018-02-02 18:28:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:56,899 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-02-02 18:28:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:28:56,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-02-02 18:28:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:56,900 INFO L225 Difference]: With dead ends: 56 [2018-02-02 18:28:56,900 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 18:28:56,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:28:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 18:28:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-02-02 18:28:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 18:28:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-02-02 18:28:56,901 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-02-02 18:28:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:56,901 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-02-02 18:28:56,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:28:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-02-02 18:28:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:28:56,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:56,902 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:28:56,902 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:56,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-02-02 18:28:56,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:56,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:56,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:56,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:56,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:56,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:57,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:28:57,250 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-02 18:28:57,258 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:28:57,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:28:57,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:28:57,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:28:57,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:28:57,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:28:57,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 18:28:57,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 18:28:57,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 18:28:57,547 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 34 treesize of output 34 [2018-02-02 18:28:57,553 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-02 18:28:57,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:57,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-02-02 18:28:57,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 18:28:57,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-02-02 18:28:57,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:28:57,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-02-02 18:28:57,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:28:57,659 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:68 [2018-02-02 18:28:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:57,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:28:57,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-02-02 18:28:57,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 18:28:57,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 18:28:57,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 18:28:57,724 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 26 states. [2018-02-02 18:28:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:59,019 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-02 18:28:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 18:28:59,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-02-02 18:28:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:59,020 INFO L225 Difference]: With dead ends: 69 [2018-02-02 18:28:59,020 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 18:28:59,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 18:28:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 18:28:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-02-02 18:28:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 18:28:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-02 18:28:59,022 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2018-02-02 18:28:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:59,023 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-02 18:28:59,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 18:28:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-02 18:28:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:28:59,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:28:59,024 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 18:28:59,024 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:28:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-02-02 18:28:59,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:28:59,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:28:59,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:59,025 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:28:59,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:28:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:59,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:28:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:59,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:28:59,288 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:28:59,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:28:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:28:59,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:28:59,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:28:59,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:59,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:59,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:28:59,347 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 15 treesize of output 12 [2018-02-02 18:28:59,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:28:59,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:28:59,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:59,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:28:59,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-02 18:28:59,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-02 18:28:59,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 18:28:59,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:28:59,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:28:59,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:28:59,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-02 18:28:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:28:59,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:28:59,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2018-02-02 18:28:59,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:28:59,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:28:59,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:28:59,492 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2018-02-02 18:28:59,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:28:59,866 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-02 18:28:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:28:59,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-02 18:28:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:28:59,918 INFO L225 Difference]: With dead ends: 61 [2018-02-02 18:28:59,918 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 18:28:59,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2018-02-02 18:28:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 18:28:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 18:28:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 18:28:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 18:28:59,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-02-02 18:28:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:28:59,919 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 18:28:59,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:28:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 18:28:59,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 18:28:59,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:28:59 BoogieIcfgContainer [2018-02-02 18:28:59,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:28:59,923 INFO L168 Benchmark]: Toolchain (without parser) took 11470.42 ms. Allocated memory was 402.7 MB in the beginning and 754.5 MB in the end (delta: 351.8 MB). Free memory was 360.7 MB in the beginning and 527.1 MB in the end (delta: -166.4 MB). Peak memory consumption was 185.4 MB. Max. memory is 5.3 GB. [2018-02-02 18:28:59,924 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 366.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:28:59,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.45 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:28:59,924 INFO L168 Benchmark]: Boogie Preprocessor took 24.19 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:28:59,924 INFO L168 Benchmark]: RCFGBuilder took 180.91 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 326.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:28:59,924 INFO L168 Benchmark]: TraceAbstraction took 11108.01 ms. Allocated memory was 402.7 MB in the beginning and 754.5 MB in the end (delta: 351.8 MB). Free memory was 326.3 MB in the beginning and 527.1 MB in the end (delta: -200.8 MB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:28:59,925 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 366.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.45 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.19 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 180.91 ms. Allocated memory is still 402.7 MB. Free memory was 347.5 MB in the beginning and 326.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11108.01 ms. Allocated memory was 402.7 MB in the beginning and 754.5 MB in the end (delta: 351.8 MB). Free memory was 326.3 MB in the beginning and 527.1 MB in the end (delta: -200.8 MB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 11.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 578 SDtfs, 1106 SDslu, 2206 SDs, 0 SdLazy, 2587 SolverSat, 311 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 123 SyntacticMatches, 9 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, 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, 16 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 525 ConstructedInterpolants, 20 QuantifiedInterpolants, 173157 SizeOfPredicates, 41 NumberOfNonLiveVariables, 641 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 23/107 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-28-59-931.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-28-59-931.csv Received shutdown request...