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/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:49:29,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:49:29,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:49:29,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:49:29,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:49:29,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:49:29,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:49:29,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:49:29,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:49:29,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:49:29,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:49:29,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:49:29,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:49:29,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:49:29,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:49:29,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:49:29,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:49:29,406 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:49:29,407 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:49:29,408 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:49:29,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:49:29,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:49:29,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:49:29,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:49:29,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:49:29,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:49:29,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:49:29,413 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:49:29,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:49:29,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:49:29,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:49:29,414 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:49:29,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:49:29,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:49:29,424 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:49:29,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:49:29,425 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:49:29,426 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:49:29,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:49:29,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:49:29,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:49:29,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:49:29,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:49:29,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:49:29,427 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:49:29,428 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:49:29,428 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:49:29,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:49:29,461 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:49:29,463 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:49:29,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:49:29,464 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:49:29,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 00:49:29,587 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:49:29,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:49:29,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:49:29,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:49:29,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:49:29,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29, skipping insertion in model container [2018-02-04 00:49:29,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,613 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:49:29,648 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:49:29,732 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:49:29,743 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:49:29,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29 WrapperNode [2018-02-04 00:49:29,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:49:29,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:49:29,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:49:29,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:49:29,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... [2018-02-04 00:49:29,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:49:29,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:49:29,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:49:29,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:49:29,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:49:29,818 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:49:29,818 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:49:29,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:49:29,955 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:49:29,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:49:29 BoogieIcfgContainer [2018-02-04 00:49:29,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:49:29,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:49:29,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:49:29,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:49:29,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:49:29" (1/3) ... [2018-02-04 00:49:29,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:49:29, skipping insertion in model container [2018-02-04 00:49:29,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:49:29" (2/3) ... [2018-02-04 00:49:29,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:49:29, skipping insertion in model container [2018-02-04 00:49:29,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:49:29" (3/3) ... [2018-02-04 00:49:29,961 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-04 00:49:29,966 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:49:29,970 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 00:49:30,002 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:49:30,003 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:49:30,003 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:49:30,003 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:49:30,003 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:49:30,003 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:49:30,003 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:49:30,004 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:49:30,004 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:49:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 00:49:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:49:30,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,023 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,024 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,027 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-04 00:49:30,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,076 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:49:30,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:49:30,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:49:30,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:49:30,204 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 00:49:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,315 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 00:49:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:49:30,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 00:49:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,322 INFO L225 Difference]: With dead ends: 74 [2018-02-04 00:49:30,322 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:49:30,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:49:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:49:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-04 00:49:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 00:49:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-04 00:49:30,347 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-04 00:49:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,347 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-04 00:49:30,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:49:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-04 00:49:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:49:30,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,348 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,348 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-04 00:49:30,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:49:30,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:49:30,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:49:30,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:49:30,422 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-04 00:49:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,474 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-04 00:49:30,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:49:30,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:49:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,475 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:49:30,475 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:49:30,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:49:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:49:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-04 00:49:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 00:49:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 00:49:30,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-04 00:49:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,481 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 00:49:30,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:49:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 00:49:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:49:30,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,482 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,482 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-04 00:49:30,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,483 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:49:30,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:49:30,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:49:30,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,526 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-04 00:49:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,563 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-04 00:49:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:49:30,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 00:49:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,564 INFO L225 Difference]: With dead ends: 69 [2018-02-04 00:49:30,565 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 00:49:30,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 00:49:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-04 00:49:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:49:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-04 00:49:30,571 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-04 00:49:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,572 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-04 00:49:30,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:49:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-04 00:49:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:49:30,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,573 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,573 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-04 00:49:30,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,574 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:49:30,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:49:30,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:49:30,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,613 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-04 00:49:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,653 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 00:49:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:49:30,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 00:49:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,654 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:49:30,654 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:49:30,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:49:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 00:49:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:49:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-04 00:49:30,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-04 00:49:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,660 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-04 00:49:30,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:49:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-04 00:49:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:49:30,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,661 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,661 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,661 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-04 00:49:30,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,661 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,662 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:30,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:49:30,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:49:30,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,708 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-04 00:49:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,719 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 00:49:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:49:30,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 00:49:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,720 INFO L225 Difference]: With dead ends: 47 [2018-02-04 00:49:30,720 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 00:49:30,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 00:49:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 00:49:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 00:49:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-04 00:49:30,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-04 00:49:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,722 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-04 00:49:30,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:49:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-04 00:49:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:49:30,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,723 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,723 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-04 00:49:30,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:30,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:49:30,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:49:30,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:49:30,769 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-04 00:49:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,790 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 00:49:30,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:49:30,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 00:49:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,791 INFO L225 Difference]: With dead ends: 44 [2018-02-04 00:49:30,791 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 00:49:30,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:49:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 00:49:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 00:49:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 00:49:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-04 00:49:30,793 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-04 00:49:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,793 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-04 00:49:30,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:49:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-04 00:49:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:49:30,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,794 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-04 00:49:30,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:30,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:49:30,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:49:30,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:49:30,844 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-04 00:49:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,900 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 00:49:30,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:49:30,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 00:49:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,901 INFO L225 Difference]: With dead ends: 50 [2018-02-04 00:49:30,901 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 00:49:30,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:49:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 00:49:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-04 00:49:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 00:49:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 00:49:30,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-04 00:49:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,905 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 00:49:30,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:49:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 00:49:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:49:30,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,906 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,906 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-04 00:49:30,906 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,907 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:30,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:30,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:49:30,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:49:30,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:49:30,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:49:30,949 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-04 00:49:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:30,966 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-04 00:49:30,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:49:30,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 00:49:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:30,967 INFO L225 Difference]: With dead ends: 73 [2018-02-04 00:49:30,967 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 00:49:30,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:49:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 00:49:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-04 00:49:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 00:49:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 00:49:30,970 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-04 00:49:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:30,970 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 00:49:30,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:49:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 00:49:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 00:49:30,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:30,971 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:30,971 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-04 00:49:30,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:30,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:30,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:30,972 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:30,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:49:31,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:49:31,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:49:31,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:49:31,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:49:31,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:31,017 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-04 00:49:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:31,027 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 00:49:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:49:31,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 00:49:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:31,028 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:49:31,028 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:49:31,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:49:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:49:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-04 00:49:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 00:49:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 00:49:31,031 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-04 00:49:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:31,031 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 00:49:31,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:49:31,031 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 00:49:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:49:31,031 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:31,031 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:31,031 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-04 00:49:31,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:31,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:31,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:31,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:31,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:31,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:31,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:49:31,114 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:49:31,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:31,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:49:31,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:49:31,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:49:31,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:31,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:31,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 00:49:31,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:49:31,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 00:49:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:31,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:49:31,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-02-04 00:49:31,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:49:31,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:49:31,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:49:31,259 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 11 states. [2018-02-04 00:49:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:49:31,463 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-04 00:49:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:49:31,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 00:49:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:49:31,465 INFO L225 Difference]: With dead ends: 72 [2018-02-04 00:49:31,465 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 00:49:31,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:49:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 00:49:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-02-04 00:49:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 00:49:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-04 00:49:31,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-04 00:49:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:49:31,468 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-04 00:49:31,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:49:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-04 00:49:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 00:49:31,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:49:31,469 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:49:31,469 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:49:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-04 00:49:31,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:49:31,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:49:31,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:31,470 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:31,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:49:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:31,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:49:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:31,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:49:31,737 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:49:31,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:49:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:49:31,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:49:31,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:49:31,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,810 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 23 treesize of output 22 [2018-02-04 00:49:31,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 00:49:31,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,833 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 22 treesize of output 21 [2018-02-04 00:49:31,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:31,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:49:31,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:49:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:32,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:32,039 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 52 treesize of output 46 [2018-02-04 00:49:32,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:32,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:32,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:32,074 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 47 treesize of output 41 [2018-02-04 00:49:32,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:32,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:49:32,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-04 00:49:32,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:32,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-02-04 00:49:32,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:49:32,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 00:49:32,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:49:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:49:32,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:49:32,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-04 00:49:32,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:49:32,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:49:32,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-02-04 00:49:32,460 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 21 states. [2018-02-04 00:50:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:11,492 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-02-04 00:50:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:50:11,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-02-04 00:50:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:11,494 INFO L225 Difference]: With dead ends: 116 [2018-02-04 00:50:11,494 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 00:50:11,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=151, Invalid=901, Unknown=4, NotChecked=0, Total=1056 [2018-02-04 00:50:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 00:50:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 55. [2018-02-04 00:50:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 00:50:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-04 00:50:11,499 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-04 00:50:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:11,500 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-04 00:50:11,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:50:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-04 00:50:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:50:11,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:11,501 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:11,501 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:11,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-04 00:50:11,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:11,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:11,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:11,503 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:11,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:11,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:50:11,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:11,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:50:11,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:50:11,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:50:11,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:50:11,528 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-04 00:50:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:11,549 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-04 00:50:11,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:50:11,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 00:50:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:11,550 INFO L225 Difference]: With dead ends: 64 [2018-02-04 00:50:11,550 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:50:11,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:50:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:50:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-04 00:50:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:50:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 00:50:11,554 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-04 00:50:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:11,554 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 00:50:11,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:50:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 00:50:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 00:50:11,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:11,555 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:11,555 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-04 00:50:11,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:11,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:11,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:11,557 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:11,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:11,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:11,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:11,651 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:11,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:11,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:11,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:11,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-02-04 00:50:11,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:50:11,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:50:11,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-02-04 00:50:11,815 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 13 states. [2018-02-04 00:50:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:12,061 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-04 00:50:12,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:50:12,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 00:50:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:12,098 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:50:12,098 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 00:50:12,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306 [2018-02-04 00:50:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 00:50:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 00:50:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 00:50:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-04 00:50:12,100 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-04 00:50:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:12,101 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-04 00:50:12,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:50:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-04 00:50:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:50:12,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:12,101 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:12,101 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-04 00:50:12,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:12,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:12,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:12,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:12,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:12,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:12,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:50:12,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:50:12,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:50:12,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:50:12,132 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-04 00:50:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:12,158 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-04 00:50:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:50:12,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 00:50:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:12,158 INFO L225 Difference]: With dead ends: 74 [2018-02-04 00:50:12,158 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 00:50:12,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:50:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 00:50:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-04 00:50:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 00:50:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 00:50:12,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-04 00:50:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:12,161 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 00:50:12,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:50:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 00:50:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:50:12,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:12,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:12,161 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:12,161 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-04 00:50:12,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:12,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:12,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:12,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:12,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:12,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:12,188 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:12,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:12,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:12,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:12,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 00:50:12,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:50:12,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:50:12,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:12,237 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 7 states. [2018-02-04 00:50:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:12,276 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-04 00:50:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:50:12,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-02-04 00:50:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:12,277 INFO L225 Difference]: With dead ends: 85 [2018-02-04 00:50:12,277 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 00:50:12,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 00:50:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-04 00:50:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 00:50:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-04 00:50:12,280 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-04 00:50:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:12,281 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-04 00:50:12,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:50:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-04 00:50:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 00:50:12,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:12,282 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:12,282 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-04 00:50:12,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:12,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:12,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,283 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:12,283 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:12,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:12,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:12,585 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:12,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:12,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:12,625 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 23 treesize of output 22 [2018-02-04 00:50:12,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:50:12,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,650 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 25 treesize of output 24 [2018-02-04 00:50:12,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,651 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 22 treesize of output 21 [2018-02-04 00:50:12,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:50:12,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:50:12,916 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:12,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:12,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-02-04 00:50:12,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:12,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:12,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:50:12,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:12,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:50:12,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-02-04 00:50:13,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:13,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:13,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:50:13,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:13,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:13,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:13,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-02-04 00:50:13,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:13,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:50:13,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-02-04 00:50:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:13,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:13,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-04 00:50:13,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:50:13,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:50:13,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=617, Unknown=1, NotChecked=0, Total=702 [2018-02-04 00:50:13,208 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 27 states. [2018-02-04 00:50:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:13,915 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-04 00:50:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:50:13,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-02-04 00:50:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:13,916 INFO L225 Difference]: With dead ends: 99 [2018-02-04 00:50:13,916 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 00:50:13,916 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1230, Unknown=4, NotChecked=0, Total=1406 [2018-02-04 00:50:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 00:50:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2018-02-04 00:50:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:50:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-04 00:50:13,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-04 00:50:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:13,918 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-04 00:50:13,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:50:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-04 00:50:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:50:13,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:13,920 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:13,920 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-04 00:50:13,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:13,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:13,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:13,921 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:13,921 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:13,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:50:13,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:50:13,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:50:13,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:50:13,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:50:13,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:50:13,990 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-04 00:50:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:14,091 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 00:50:14,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:50:14,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 00:50:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:14,092 INFO L225 Difference]: With dead ends: 64 [2018-02-04 00:50:14,092 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:50:14,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:50:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-04 00:50:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:50:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-04 00:50:14,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-04 00:50:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:14,095 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-04 00:50:14,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:50:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-04 00:50:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:50:14,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:14,096 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:14,096 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-04 00:50:14,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:14,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:14,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:14,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:14,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:14,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:50:14,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:14,282 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:14,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:14,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:14,350 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-04 00:50:14,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:50:14,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:50:14,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 00:50:14,455 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:14,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:50:14,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-02-04 00:50:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:14,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:14,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-02-04 00:50:14,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:50:14,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:50:14,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:50:14,488 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 21 states. [2018-02-04 00:50:14,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:14,687 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-02-04 00:50:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 00:50:14,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-02-04 00:50:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:14,687 INFO L225 Difference]: With dead ends: 92 [2018-02-04 00:50:14,687 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 00:50:14,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:50:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 00:50:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-02-04 00:50:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:50:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-02-04 00:50:14,691 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 43 [2018-02-04 00:50:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:14,691 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-02-04 00:50:14,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:50:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-02-04 00:50:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:50:14,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:14,692 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:14,692 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-04 00:50:14,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:14,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:14,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:14,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:14,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:14,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:14,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:14,907 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:14,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:14,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:14,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:50:14,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:50:14,970 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-04 00:50:14,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:50:14,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:14,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 00:50:15,007 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 13 treesize of output 1 [2018-02-04 00:50:15,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-02-04 00:50:15,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 00:50:15,050 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:15,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 00:50:15,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-02-04 00:50:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:15,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:15,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2018-02-04 00:50:15,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:50:15,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:50:15,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:50:15,076 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 23 states. [2018-02-04 00:50:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:15,306 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-02-04 00:50:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:50:15,306 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-02-04 00:50:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:15,307 INFO L225 Difference]: With dead ends: 84 [2018-02-04 00:50:15,307 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 00:50:15,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:50:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 00:50:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 00:50:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:50:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-02-04 00:50:15,309 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 43 [2018-02-04 00:50:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:15,309 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-02-04 00:50:15,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:50:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-02-04 00:50:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 00:50:15,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:15,310 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:15,310 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-04 00:50:15,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:15,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:15,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:15,311 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:15,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:15,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:50:15,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:15,329 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:15,334 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:15,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:50:15,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:50:15,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 00:50:15,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:50:15,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:50:15,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:50:15,377 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 6 states. [2018-02-04 00:50:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:15,414 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-04 00:50:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:50:15,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 00:50:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:15,415 INFO L225 Difference]: With dead ends: 82 [2018-02-04 00:50:15,415 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 00:50:15,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:15,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 00:50:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 00:50:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 00:50:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 00:50:15,418 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 45 [2018-02-04 00:50:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:15,418 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 00:50:15,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:50:15,418 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 00:50:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:50:15,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:15,422 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:15,422 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-04 00:50:15,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:15,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:15,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:15,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:15,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:15,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:50:15,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:15,712 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:15,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:15,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:15,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 00:50:15,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:50:15,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:15,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:15,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:50:15,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-02-04 00:50:15,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 00:50:15,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:50:15,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33 [2018-02-04 00:50:15,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 00:50:15,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:15,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 00:50:15,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31 [2018-02-04 00:50:16,001 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 36 treesize of output 30 [2018-02-04 00:50:16,003 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:16,003 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 30 treesize of output 20 [2018-02-04 00:50:16,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:16,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:16,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:16,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-02-04 00:50:16,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:50:16,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 00:50:16,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:16,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:50:16,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:50:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:50:16,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:16,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-02-04 00:50:16,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:50:16,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:50:16,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:50:16,077 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 34 states. [2018-02-04 00:50:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:17,267 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-02-04 00:50:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 00:50:17,297 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-04 00:50:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:17,297 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:50:17,297 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 00:50:17,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=572, Invalid=3588, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 00:50:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 00:50:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2018-02-04 00:50:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:50:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-04 00:50:17,301 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 48 [2018-02-04 00:50:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:17,301 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-04 00:50:17,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:50:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-04 00:50:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 00:50:17,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:17,302 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:17,302 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811558, now seen corresponding path program 1 times [2018-02-04 00:50:17,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:17,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:17,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:17,304 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:17,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:50:17,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:17,335 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:17,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:17,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 00:50:17,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:17,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 00:50:17,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:50:17,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:50:17,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:50:17,413 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 7 states. [2018-02-04 00:50:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:17,447 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-02-04 00:50:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:50:17,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 00:50:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:17,449 INFO L225 Difference]: With dead ends: 90 [2018-02-04 00:50:17,449 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:50:17,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:50:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:50:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-02-04 00:50:17,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:50:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-02-04 00:50:17,452 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 48 [2018-02-04 00:50:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:17,452 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-02-04 00:50:17,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:50:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-02-04 00:50:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 00:50:17,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:17,453 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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-04 00:50:17,453 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-04 00:50:17,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:17,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:17,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:17,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:17,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:50:17,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:17,487 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:17,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:17,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:50:17,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:17,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 00:50:17,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:50:17,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:50:17,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:50:17,577 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-02-04 00:50:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:50:17,614 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-04 00:50:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:50:17,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-02-04 00:50:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:50:17,615 INFO L225 Difference]: With dead ends: 124 [2018-02-04 00:50:17,615 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 00:50:17,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:50:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 00:50:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89. [2018-02-04 00:50:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 00:50:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-04 00:50:17,618 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 49 [2018-02-04 00:50:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:50:17,618 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-04 00:50:17,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:50:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-04 00:50:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:50:17,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:50:17,619 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:50:17,619 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:50:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-04 00:50:17,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:50:17,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:50:17,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:17,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:50:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:17,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:50:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 00:50:18,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:50:18,272 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:50:18,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:50:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:50:18,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:50:18,487 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 49 treesize of output 46 [2018-02-04 00:50:18,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:50:18,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,499 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 49 treesize of output 46 [2018-02-04 00:50:18,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:50:18,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:50:18,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-02-04 00:50:18,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-02-04 00:50:18,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,676 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 53 treesize of output 35 [2018-02-04 00:50:18,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:18,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 00:50:18,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-02-04 00:50:26,873 WARN L146 SmtUtils]: Spent 4038ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-02-04 00:50:28,965 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 00:50:31,040 WARN L143 SmtUtils]: Spent 2019ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 00:50:31,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-02-04 00:50:31,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-02-04 00:50:31,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:31,106 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:31,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-02-04 00:50:31,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:31,144 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:31,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 82 [2018-02-04 00:50:31,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 00:50:31,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:31,199 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 75 treesize of output 67 [2018-02-04 00:50:31,201 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:31,201 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:50:31,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-02-04 00:50:31,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:50:31,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:50:31,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:50:31,236 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-02-04 00:50:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:50:33,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:50:33,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 36 [2018-02-04 00:50:33,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 00:50:33,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 00:50:33,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1213, Unknown=23, NotChecked=0, Total=1332 [2018-02-04 00:50:33,425 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 37 states. [2018-02-04 00:50:48,242 WARN L146 SmtUtils]: Spent 2072ms on a formula simplification. DAG size of input: 148 DAG size of output 36 [2018-02-04 00:50:51,451 WARN L146 SmtUtils]: Spent 2859ms on a formula simplification. DAG size of input: 170 DAG size of output 41 [2018-02-04 00:50:54,862 WARN L146 SmtUtils]: Spent 3093ms on a formula simplification. DAG size of input: 179 DAG size of output 45 [2018-02-04 00:50:55,157 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 138 DAG size of output 87 [2018-02-04 00:50:55,396 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 128 DAG size of output 76 [2018-02-04 00:50:57,598 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 102 DAG size of output 61 [2018-02-04 00:50:57,861 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 118 DAG size of output 75 [2018-02-04 00:51:02,204 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 105 DAG size of output 79 [2018-02-04 00:51:06,751 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 87 DAG size of output 74 [2018-02-04 00:51:11,578 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-02-04 00:51:11,818 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-02-04 00:51:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:51:11,840 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2018-02-04 00:51:11,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 00:51:11,840 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2018-02-04 00:51:11,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:51:11,841 INFO L225 Difference]: With dead ends: 111 [2018-02-04 00:51:11,841 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 00:51:11,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=449, Invalid=3673, Unknown=38, NotChecked=0, Total=4160 [2018-02-04 00:51:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 00:51:11,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-02-04 00:51:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 00:51:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-04 00:51:11,843 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 51 [2018-02-04 00:51:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:51:11,843 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-04 00:51:11,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 00:51:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-04 00:51:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 00:51:11,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:51:11,844 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:51:11,844 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:51:11,844 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times [2018-02-04 00:51:11,844 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:51:11,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:51:11,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:51:11,845 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:51:11,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:51:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:51:11,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:51:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 00:51:12,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:51:12,086 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:51:12,091 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:51:12,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:51:12,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:51:12,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:51:12,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 00:51:12,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 00:51:12,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 00:51:12,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,176 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 25 treesize of output 24 [2018-02-04 00:51:12,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:51:12,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 00:51:12,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-02-04 00:51:12,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,454 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 44 treesize of output 38 [2018-02-04 00:51:12,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-02-04 00:51:12,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:12,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 00:51:12,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:12,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 00:51:12,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 00:51:13,073 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-02-04 00:51:13,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-02-04 00:51:13,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-02-04 00:51:13,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:13,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,627 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 54 treesize of output 48 [2018-02-04 00:51:13,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:13,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,630 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 60 treesize of output 54 [2018-02-04 00:51:13,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:13,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-02-04 00:51:13,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:13,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-02-04 00:51:13,896 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:14,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2018-02-04 00:51:14,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:14,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-02-04 00:51:14,374 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:14,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,667 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 54 treesize of output 48 [2018-02-04 00:51:14,667 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:14,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:14,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-02-04 00:51:14,671 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:14,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 00:51:14,883 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 00:51:16,716 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 00:51:16,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:16,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:16,984 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 61 treesize of output 55 [2018-02-04 00:51:16,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:17,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 82 [2018-02-04 00:51:17,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:17,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-02-04 00:51:17,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:17,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,475 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 52 treesize of output 46 [2018-02-04 00:51:17,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:17,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:17,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-02-04 00:51:17,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:18,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 90 [2018-02-04 00:51:18,258 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:18,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-02-04 00:51:18,530 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 00:51:18,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,787 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 54 treesize of output 48 [2018-02-04 00:51:18,787 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:18,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:18,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-02-04 00:51:18,791 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:19,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:19,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:19,090 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 52 treesize of output 46 [2018-02-04 00:51:19,091 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:19,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:19,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:51:19,093 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 58 treesize of output 52 [2018-02-04 00:51:19,094 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:19,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-02-04 00:51:19,332 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-02-04 00:51:21,654 WARN L146 SmtUtils]: Spent 2122ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-02-04 00:51:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 00:51:21,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:51:21,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-04 00:51:21,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 00:51:21,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 00:51:21,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=729, Unknown=1, NotChecked=0, Total=812 [2018-02-04 00:51:21,693 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 29 states. [2018-02-04 00:51:34,468 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-04 00:51:36,684 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 00:51:36,872 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 60 DAG size of output 55 [2018-02-04 00:51:37,104 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-02-04 00:51:37,407 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-02-04 00:51:37,713 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-02-04 00:51:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:51:38,398 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-02-04 00:51:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 00:51:38,398 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-02-04 00:51:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:51:38,399 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:51:38,399 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:51:38,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=270, Invalid=1981, Unknown=5, NotChecked=0, Total=2256 [2018-02-04 00:51:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:51:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 81. [2018-02-04 00:51:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 00:51:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 00:51:38,401 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 54 [2018-02-04 00:51:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:51:38,401 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 00:51:38,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 00:51:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 00:51:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:51:38,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:51:38,401 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:51:38,402 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 00:51:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times [2018-02-04 00:51:38,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:51:38,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:51:38,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:51:38,402 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:51:38,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:51:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:51:38,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:51:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 00:51:38,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:51:38,581 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:51:38,586 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:51:38,604 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:51:38,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:51:38,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:51:38,693 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-04 00:51:38,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 00:51:38,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:38,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:51:38,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:51:38,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 00:51:44,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:51:44,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 00:51:44,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:51:44,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:51:44,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:51:44,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 00:51:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 00:51:44,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:51:44,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-02-04 00:51:44,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:51:44,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:51:44,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=405, Unknown=3, NotChecked=0, Total=462 [2018-02-04 00:51:44,846 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 22 states. [2018-02-04 00:53:07,746 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 27 Received shutdown request... [2018-02-04 00:53:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:53:09,800 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 00:53:09,803 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 00:53:09,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:53:09 BoogieIcfgContainer [2018-02-04 00:53:09,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:53:09,804 INFO L168 Benchmark]: Toolchain (without parser) took 220216.14 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 360.6 MB in the beginning and 617.6 MB in the end (delta: -257.0 MB). Peak memory consumption was 62.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:09,804 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:53:09,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.30 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 347.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:09,804 INFO L168 Benchmark]: Boogie Preprocessor took 31.32 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:09,805 INFO L168 Benchmark]: RCFGBuilder took 175.49 ms. Allocated memory is still 403.7 MB. Free memory was 346.0 MB in the beginning and 328.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:09,805 INFO L168 Benchmark]: TraceAbstraction took 219847.00 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 326.7 MB in the beginning and 617.6 MB in the end (delta: -290.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. [2018-02-04 00:53:09,805 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.30 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 347.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.32 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.49 ms. Allocated memory is still 403.7 MB. Free memory was 346.0 MB in the beginning and 328.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 219847.00 ms. Allocated memory was 403.7 MB in the beginning and 723.0 MB in the end (delta: 319.3 MB). Free memory was 326.7 MB in the beginning and 617.6 MB in the end (delta: -290.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 32 states, 22 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 219.8s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 182.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1043 SDtfs, 2081 SDslu, 5439 SDs, 0 SdLazy, 5908 SolverSat, 498 SolverUnsat, 102 SolverUnknown, 0 SolverNotchecked, 124.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1009 GetRequests, 550 SyntacticMatches, 21 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3695 ImplicationChecksByTransitivity, 84.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=23, 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, 25 MinimizatonAttempts, 428 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1495 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1455 ConstructedInterpolants, 137 QuantifiedInterpolants, 681331 SizeOfPredicates, 74 NumberOfNonLiveVariables, 2175 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 40 InterpolantComputations, 13 PerfectInterpolantSequences, 360/633 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-53-09-810.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-53-09-810.csv Completed graceful shutdown